Arboricity and Subgraph Listing Algorithms

@article{Chiba1985ArboricityAS,
  title={Arboricity and Subgraph Listing Algorithms},
  author={Norishige Chiba and Takao Nishizeki},
  journal={SIAM J. Comput.},
  year={1985},
  volume={14},
  pages={210-223},
  url={https://api.semanticscholar.org/CorpusID:207051803}
}
A new simple strategy into edge-searching of a graph, which is useful to the various subgraph listing problems, is introduced, and an upper bound on $a(G)$ is established for a graph $G:a (G) \leqq \lceil (2m + n)^{1/2} \rceil $, where n is the number of vertices in G.
View via Publisher
cs.cornell.edu
732 Citations
Highly Influential Citations
98
Background Citations
320
Methods Citations
212
Results Citations
9

Figures from this paper

732 Citations

Finding Small Complete Subgraphs Efficiently

This work provides a new very simple combinatorial algorithm for finding all triangles in a graph and shows that is amenable to the same running time analysis as Chiba and Nishizeki's (1985), and derives worst-case bounds from first principles and with very simple proofs.

New algorithms for $k$-degenerate graphs

New algorithms for cliques and similar structures for these graphs are proved and another optimal algorithm listing all maximal cliques in time is shown, matching the best possible complexity proved.

Listing 6-Cycles

A simple algorithm is given that lists $t$ (non-induced) $6-cycles in an $n$-node undirected graph in $\tilde O(n^2+t)$ time, which nearly matches the fastest known algorithm for detecting a $6$-cycle in $O(n2) $ time by Yuster and Zwick (1997).

Subgraph Enumeration in Massive Graphs

A lower bound shows that the deterministic algorithm is optimal for some pattern graphs with $s=k/2$ (e.g., paths and cycles of even length, meshes of even side), while the randomized algorithm is ideal for a wide class of pattern graphs, called Alon class.

Counting subgraphs via DAG tree decompositions

A decomposition for directed acyclic graphs, which induces a width measure on every undirected pattern $H$, and leads to a dynamic programming to count the copies of $H$ in $G$ in time $f(d,k) \cdot \tilde{O}(n^{s(H)})$, which is tight in the following sense: if any algorithm solves the problem in time, then ETH fails.

A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling

The focus here is on designing a sublinear-time algorithm that can estimate the number of any arbitrary subgraph H in a graph G to within a $(1\pm \epsilon)$-approximation w.p.h. in $O(\frac{m^{\rho(H)}}{\#H}) \cdot poly(\log{n},1/\epsilons)$ time.

Simple and efficient four-cycle counting on sparse graphs

This paper develops a streamlined version of the Wang et al. (2019) algorithm, which is fully deterministic, does not require any auxiliary storage or sorting of the input graph, and uses only addition and array access in its inner loops.

Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six

It is proved that for all $k < 6, sub-cnt$_k$ cannot be solved even in near-linear time, which is a standard conjecture in fine-grained complexity.

Arboricity and spanning-tree packing in random graphs with an application to load balancing

A direct application of this result gives a sharp threshold for the maximum load being at most k in the two-choice load balancing problem, where k → ∞.

Arboricity, h-index, and dynamic algorithms

...

7 References

An approximation algorithm for the hamiltonian walk problem on maximal planar graphs

Finding a minimum circuit in a graph

Finding minimum circuits in graphs and digraphs is discussed and an algorithm to find an almost minimum circuit is presented and an alternative method is to reduce the problem of finding a minimum circuit to that of finding an auxiliary graph.

An algorithm for finding a large independent set in planar graphs

An O(n2) algorithm for finding an independent set that contains more than two-ninth of the vertices of a planar graph is given.

An Analysis of Some Graph Theoretical Cluster Techniques

Several graph theoretic cluster techniques aimed at the automatic generation of thesauri for information retrieval systems are explored and two algorithms have been tested that find maximal complete subgraphs.