# All maximal independent sets and dynamic dominance for sparse graphs

@article{Eppstein2009AllMI,
title={All maximal independent sets and dynamic dominance for sparse graphs},
author={D. Eppstein},
journal={ArXiv},
year={2009},
volume={cs.DS/0407036}
}
• D. Eppstein
• Published 2009
• Mathematics, Computer Science
• ArXiv
We describe algorithms, based on Avis and Fukuda's reverse search paradigm, for listing all maximal independent sets in a sparse graph in polynomial time and delay per output. For bounded degree graphs, our algorithms take constant time per set generated; for minor-closed graph families, the time is O(n) per set, and for more general sparse graph families we achieve subquadratic time per set. We also describe new data structures for maintaining a dynamic vertex set S in a sparse or minor-closed… Expand
48 Citations
Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time
• Mathematics, Computer Science
• Exact Complexity of NP-hard Problems
• 2010
There exists a nearly-optimal fixed-parameter tractable algorithm for enumerating all maximal cliques, parametrized by degeneracy, and this algorithm matches the Θ(d(n − d)3 d/3) worst-case output size of the problem whenever n − d = Ω(n). Expand
Counting the number of independent sets in chordal graphs
• Computer Science, Mathematics
• J. Discrete Algorithms
• 2008
It is proved that the following problems for a chordal graph are #P-complete: (1) counting the number of maximal independent sets; (2) countingThe number of minimum maximalindependent sets. Expand
Cliques in Odd-Minor-Free Graphs
• Computer Science, Mathematics
• CATS
• 2012
It is proved that graphs excluding a fixed odd-minor have O(n2) cliques (which is tight), and a O( n3) time algorithm for listing all cliques is concluded. Expand
VColor: A practical vertex-cut based approach for coloring large graphs
• Computer Science
• 2016 IEEE 32nd International Conference on Data Engineering (ICDE)
• 2016
This paper proposes a practical vertex-cut based coloring technique (VColor) for coloring large graphs, and proposes an optimization technique, inspired by multi-query optimization, for coloring a set of graphs. Expand
Listing All Maximal Cliques in Large Sparse Real-World Graphs
• Computer Science, Mathematics
• SEA
• 2011
We implement a new algorithm for listing all maximal cliques in sparse graphs due to Eppstein, Loffler, and Strash (ISAAC 2010) and analyze its performance on a large corpus of real-world graphs. OurExpand
C O ] 8 F eb 2 01 2 Cliques in Odd-Minor-Free Graphs ∗
• 2012
This paper is about: (1) bounds on the number of cliques in a graph in a particular class, and (2) algorithms for listing all cliques in a graph. We present a simple algorithm that lists all cliquesExpand
New Applications of the Nearest-Neighbor Chain Algorithm
The nearest-neighbor chain algorithm was proposed in the eighties as a way to speed up certain hierarchical clustering algorithms and its application is not limited to clustering, and it is shown that it applies to a variety of geometric and combinatorial problems. Expand
On the complexity of monotone dualization and generating minimal hypergraph transversals
The decomposition technique can be thought of as a generalization of that of Fredman and Khachiyan, and yields stronger bounds on the sequential complexity of the problem in the case when the sizes of f and g are significantly different, and allows for generating all minimal transversals of a given hypergraph using only polynomial space. Expand
Simultaneously Load Balancing for Every p-norm, With Reassignments
• Computer Science
• ITCS
• 2017
This paper investigates the task of load balancing where the objective function is to minimize the p-norm of loads, for p\geq 1, in both static and incremental settings. We consider two closelyExpand
Reactive Proximity Data Structures for Graphs
• Computer Science, Mathematics
• LATIN
• 2018
This work presents novel reactive proximity data structures for graphs of polynomial expansion, i.e., the class of graphs with small separators, such as planar graphs and road networks, and experimentally compares their data structure to Dijkstra's algorithm. Expand

#### References

SHOWING 1-10 OF 38 REFERENCES
Fast Algorithms for Generating All Maximal Independent Sets of Interval, Circular-Arc and Chordal Graphs
• J. Leung
• Mathematics, Computer Science
• J. Algorithms
• 1984
These algorithms compare favorably with the fastest known algorithm for general graphs which has a worst-case running time of O(n ∗ e ∗ α) . Expand
The worst-case time complexity for generating all maximal cliques and computational experiments
• Computer Science, Mathematics
• Theor. Comput. Sci.
• 2006
A depth-first search algorithm for generating all maximal cliques of an undirected graph, in which pruning methods are employed as in the Bron-Kerbosch algorithm, which proves that its worst-case time complexity is O(3n/3) for an n-vertex graph. Expand
On the problem of finding all maximum weight independent sets in interval and circular-arc graphs
• Computer Science
• [Proceedings] 1991 Symposium on Applied Computing
• 1991
The authors use a new technique to give fast and efficient algorithms for finding all the maximum weight independent sets in interval graphs and circular-arc graphs, where beta is the sum of the number of nodes in all maximal independent sets. Expand
Small Maximal Independent Sets and Faster Exact Graph Coloring
• D. Eppstein
• Computer Science, Mathematics
• J. Graph Algorithms Appl.
• 2003
It is shown how to compute the exact chromatic number of a graph in time O(4/3 + 34/3/4)n, improving a previous O((1 + 31/3)n) ≅ 2.4422n algorithm of Lawler (1976). Expand
Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
• Mathematics, Computer Science
• SIAM J. Comput.
• 1980
It is shown that it is possible to apply ideas of Paull and Unger and of Tsukiyama et al. to obtain polynomial-time algorithms for a number of special cases, e.g. the efficient generation of all maximal feasible solutions to a knapsack problem. Expand
The Worst-Case Time Complexity for Generating All Maximal Cliques
• Mathematics, Computer Science
• COCOON
• 2004
A depth-first search algorithm for generating all maximal cliques of an undirected graph, in which pruning methods are employed as in Bron and Kerbosch’s algorithm, which proves that its worst-case time complexity is O(3 n/3) for an n-vertex graph. Expand
Arboricity and Subgraph Listing Algorithms
• Mathematics, Computer Science
• SIAM J. Comput.
• 1985
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. Expand
A New Algorithm for Generating All the Maximal Independent Sets
• Mathematics, Computer Science
• SIAM J. Comput.
• 1977
This paper presents a new efficient algorithm for generating all the maximal independent sets, for which processing time and memory space are bounded by $O(nm\mu)$ and $O (n+m)$, respectively, where n, m, and $\mu$ are the numbers of vertices, edges, and maximalIndependent sets of a graph. Expand
New Algorithms for Enumerating All Maximal Cliques
• Mathematics, Computer Science
• SWAT
• 2004
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G=(V,E) with n vertices and m edges. We propose two algorithms for enumerating allExpand
Generating all maximal independent sets of bounded-degree hypergraphs
• Mathematics, Computer Science
• COLT '97
• 1997
This work shows that any monotone function with a read-k CNF representation can be learned in terms of its DNF representation with membership queries alone in time polynomial in the DNF size and n assuming k is some fixed constant. Expand