Bibliographic Details
| Title: |
Finding and counting patterns in sparse graphs. |
| Authors: |
Komarath, Balagopal1 (AUTHOR) bkomarath@rbgo.in, Kumar, Anant1 (AUTHOR) kumar_anant@iitgn.ac.in, Mishra, Suchismita1,2 (AUTHOR) suchismitamishra6@gmail.com, Sethia, Aditi1 (AUTHOR) aditi.sethia@iitgn.ac.in |
| Source: |
Journal of Computer & System Sciences. May2026, Vol. 157, pN.PAG-N.PAG. 1p. |
| Subjects: |
Sparse graphs, Algorithms, Graph theory, Polynomial time algorithms |
| Abstract: |
We consider algorithms for finding and counting small, fixed graphs in sparse host graphs. In the non-sparse setting, the parameters treedepth and treewidth play a crucial role in fast, constant-space and polynomial-space algorithms respectively. We discover two new parameters that we call matched treedepth and matched treewidth. We show that, for many patterns, finding and counting patterns with low matched treedepth and low matched treewidth can be done asymptotically faster than the existing algorithms when the host graphs are sparse. As an application to finding and counting fixed-size patterns, we discover O ˜ (m 3) -time.1 constant-space algorithms for graphs on at most 11 edges and O ˜ (m 2) -time, polynomial-space algorithms for graphs on at most 9 edges.2 [ABSTRACT FROM AUTHOR] |
|
Copyright of Journal of Computer & System Sciences is the property of Academic Press Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
