Arboricity and Subgraph Listing Algorithms

@article{Chiba1985ArboricityAS,
  title={Arboricity and Subgraph Listing Algorithms},
  author={N. Chiba and Takao Nishizeki},
  journal={SIAM J. Comput.},
  year={1985},
  volume={14},
  pages={210-223}
}
In this paper we introduce a new simple strategy into edge-searching of a graph, which is useful to the various subgraph listing problems. Applying the strategy, we obtain the following four algorithms. The first one lists all the triangles in a graph G in $O(a(G)m)$ time, where m is the number of edges of G and $a(G)$ the arboricity of G. The second finds all the quadrangles in $O(a(G)m)$ time. Since $a(G)$ is at most three for a planar graph G, both run in linear time for a planar graph. The… Expand
New algorithms for $k$-degenerate graphs
Finding Triangles or Independent Sets
Subgraph Enumeration in Massive Graphs
Counting subgraphs via DAG tree decompositions
Counting Subgraphs in Degenerate Graphs
Arboricity and spanning-tree packing in random graphs with an application to load balancing
Arboricity, h-index, and dynamic algorithms
Faster Subgraph Counting in Sparse Graphs
...
1
2
3
4
5
...

References

SHOWING 1-9 OF 9 REFERENCES
An approximation algorithm for the hamiltonian walk problem on maximal planar graphs
Finding a minimum circuit in a graph
  • A. Itai
  • Mathematics, Computer Science
  • STOC '77
  • 1977
An algorithm for finding a large independent set in planar graphs
An Analysis of Some Graph Theoretical Cluster Techniques
On approximating a vertex cover for planar graphs
"J."
PAPADIMITRIOU AND M. YANNAKAKIS, The clique problem for planar graphs, Inform
  • Proc. Lett. 13,
  • 1981
Bounds on backtrack algorithmmsfor listing cycles
  • paths, and spanning trees, Networks, 5 (1975), pp. 237-252. I11] S. TSUKIYAMA, M. IDE, I. ARIYOSHI AND I. SHIRAKAWA, A new algorithm for generating all the maximal independent sets, this Journal, 6,
  • 1977
Graph theory