Proximity Search for Maximal Subgraph Enumeration
From MaRDI portal
Publication:5048293
DOI10.1137/20M1375048zbMath1503.05061arXiv1912.13446OpenAlexW2997095431MaRDI QIDQ5048293
Luca Versari, Andrea Marino, Roberto Grossi, Alessio Conte, Takeaki Uno
Publication date: 15 November 2022
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.13446
Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Largest chordal and interval subgraphs faster than \(2^n\)
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
- Enumeration aspects of maximal cliques and bicliques
- On generating all maximal independent sets
- On enumerating all minimal solutions of feedback problems
- Output-polynomial enumeration on graphs of bounded (local) linear MIM-width
- Efficient enumeration of bipartite subgraphs in graphs
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Reverse search for enumeration
- Efficiently enumerating minimal triangulations
- Incidence matrices and interval graphs
- The vectorization of ITPACK 2C
- Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- Efficiency of a Good But Not Linear Set Union Algorithm
- Algorithmic Aspects of Vertex Elimination on Graphs
- A New Algorithm for Generating All the Maximal Independent Sets
- An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
- Listing Maximal Subgraphs Satisfying Strongly Accessible Properties
- Compression via Matroids
- Combinatorial bounds via measure and conquer
- New polynomial delay bounds for maximal subgraph enumeration by proximity search
- On the Enumeration of Minimal Dominating Sets and Related Notions
- Listing All Maximal Cliques in Large Sparse Real-World Graphs
- k-Degenerate Graphs
- Graph-Theoretic Concepts in Computer Science
- On cliques in graphs
