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}
}
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
A graph is $k$-degenerate if any induced subgraph has a vertex of degree at most $k$. In this paper we prove new algorithms for cliques and similar structures for these graphs. We design linear timeExpand
Finding Triangles or Independent Sets
TLDR
This work revisits the algorithmic problem of finding all triangles in a graph G = (V,E) with n vertices and m edges and provides a combinatorial algorithm that is amenable to the same running time analysis and shows that the running time of such an algorithm cannot be improved in the worst-case and for the entire range of parameters m and n. Expand
Subgraph Enumeration in Massive Graphs
TLDR
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. Expand
Counting subgraphs via DAG tree decompositions
TLDR
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. Expand
Counting Subgraphs in Degenerate Graphs
TLDR
It is shown that this sufficient condition for a graph to be easy if there is a linear-time algorithm for counting the number of copies in an input graph of bounded degeneracy is also necessary, thus fully answering the Bera--Pashanasangi--Seshadhri problem. Expand
A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling
TLDR
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. Expand
Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six
TLDR
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. Expand
Arboricity and spanning-tree packing in random graphs with an application to load balancing
TLDR
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 → ∞. Expand
Arboricity, h-index, and dynamic algorithms
TLDR
Using the proposed data structure, several dynamic algorithms for solving problems as listing the cliques of a given size, recognizing diamond-free graphs, and finding simple, simplicial and dominated vertices are described. Expand
Faster Subgraph Counting in Sparse Graphs
TLDR
This work shows that, if one takes into account the degeneracy of $G$, then the picture becomes substantially richer and leads to faster algorithms when $G$ is sufficiently sparse, and develops bounds on $\tau(H)$, which obtain natural generalisations of classic results and faster algorithms for sparse graphs. Expand
...
1
2
3
4
5
...

References

SHOWING 1-9 OF 9 REFERENCES
An approximation algorithm for the hamiltonian walk problem on maximal planar graphs
TLDR
An approximation algorithm is presented that finds, in O(p2) time, a closed spanning walk of a given arbitrary maximal planar graph, and the length of the obtained walk is at most 3 2 (p − 3) if the graph has p (≥ 9) vertices. Expand
Finding a minimum circuit in a graph
  • A. Itai
  • Mathematics, Computer Science
  • STOC '77
  • 1977
TLDR
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. Expand
An algorithm for finding a large independent set in planar graphs
TLDR
An O(n2) algorithm for finding an independent set that contains more than two-ninth of the vertices of a planar graph is given. Expand
An Analysis of Some Graph Theoretical Cluster Techniques
TLDR
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. Expand
On approximating a vertex cover for planar graphs
TLDR
The approximation problem for vertex cover of n-vertex planar graphs is treated and two results are presented: a linear time approximation algorithm and an O(n log n) time approximation scheme. Expand
"J."
however (for it was the literal soul of the life of the Redeemer, John xv. io), is the peculiar token of fellowship with the Redeemer. That love to God (what is meant here is not God’s love to men)Expand
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