CiteSeerX — Arboricity and Bipartite Subgraph Listing Algorithms

Arboricity and Bipartite Subgraph Listing Algorithms (1994) [22 citations — 1 self]

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@MISC{Eppstein94arboricityand,
    author = {David Eppstein},
    title = {Arboricity and Bipartite Subgraph Listing Algorithms},
    year = {1994}
}

Bookmarks

OpenURL

Abstract:

In graphs of bounded arboricity, the total complexity of all maximal complete bipartite subgraphs is O(n). We describe a linear time algorithm to list such subgraphs. The arboricity bound is necessary: for any constant k and any n there exists an n-vertex graph with O(n) edges and (n/ log n) k maximal complete bipartite subgraphs K k,# . # Work supported in part by NSF grant CCR-9258355. 1 Introduction A number of graph algorithms depend on finding all subgraphs of a certain type in a larger graph. For instance, in interval or chordal graphs, a decomposition into maximal cliques is key; such a decomposition can be constructed in linear time [4, 17]. Optimal triangulation construction [3] and certain planar graph computations [8] require a listing of all triangles. Related subgraph isomorphism problems also occur in a wide variety of practical applications [2, 5, 12, 9, 13, 14, 19]. For planar graphs, or more generally for graphs of bounded arboricity, the problem of listing c...

Citations

368	Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms – Booth, Lueker - 1976
250	Algorithmic aspects of vertex elimination on graphs – Rose, Tarjan, et al. - 1976
162	Mesh generation and optimal triangulation – Bern, Eppstein - 1992
135	Embedding planar graphs on the grid – Schnyder - 1990
81	A unified geometric approach to graph separators – Miller, Teng, et al. - 1991
56	Arboricity and subgraph listing algorithms – Chiba, Nishizeki - 1985
41	Edge-disjoint spanning trees of finite graphs – Nash-Williams - 1961
33	Pattern associativity and the retrieval of semantic networks – Levinson - 1992
29	Planar orientations with low out-degree and compaction of adjacency matrices – Chrobak, Eppstein - 1991
13	A linear-time algorithm for testing the inscribability of trivalent polyhedra – Dillencourt, Smith - 1992
10	games: algorithms for matroid sums and applications – Forests - 1992
7	Can visibility graphs be represented compactly – Agarwal, Alon, et al. - 1993
7	Similarity searching in databases of three-dimensional molecules and macromolecules – Artymiuk, Bath, et al. - 1992
5	Goal-oriented subgraph isomorphism technique for IC device recognition – Brown, Thomas - 1988
5	An ARG representation for Chinese characters and a radical extraction based on the representation – Hong, Youshou, et al. - 1988
4	Connectivity, graph minors, and subgraph multiplicity – Eppstein - 1993
4	Recognition of polyhedral objects under perspective views – Stahs, Wahl - 1992
3	Optimizing codes for concurrent fault detection in microprogrammed controllers – Guha - 1987
3	A sensor model registration technique for mobile robot localization – Lang, Wong - 1991