Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph
DOI10.1016/J.TCS.2018.08.009zbMATH Open1437.05102OpenAlexW2886539986WikidataQ129409158 ScholiaQ129409158MaRDI QIDQ1985603FDOQ1985603
Authors: Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa 
Publication date: 7 April 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.08.009
Recommendations
- Efficient enumeration of maximal \(k\)-degenerate subgraphs in a chordal graph
- An efficient algorithm for enumerating induced subgraphs with bounded degeneracy
- Efficient enumeration of induced subtrees in a K-degenerate graph
- An output sensitive algorithm for maximal clique enumeration in sparse graphs
- Finding a maximum induced degenerate subgraph faster than \(2^{n}\)
Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Enumeration in graph theory (05C30) Density (toughness, etc.) (05C42)
Cites Work
- Large induced degenerate subgraphs
- Title not available (Why is that?)
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Sparsity. Graphs, structures, and algorithms
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Split Graphs Having Dilworth Number Two
- Title not available (Why is that?)
- Finding a maximum induced degenerate subgraph faster than \(2^{n}\)
- Computational aspects of monotone dualization: a brief survey
- Maximum 4-degenerate subgraph of a planar graph
- Title not available (Why is that?)
- Listing all maximal cliques in large sparse real-world graphs
- Sublinear-space bounded-delay enumeration for massive network analytics: maximal cliques
- Efficient enumeration of induced subtrees in a K-degenerate graph
- Enumerating and generating labeled \(k\)-degenerate graphs
Cited In (7)
- An efficient algorithm for enumerating induced subgraphs with bounded degeneracy
- Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes
- An efficient algorithm for enumerating chordal bipartite induced subgraphs in sparse graphs
- Finding a maximum induced degenerate subgraph faster than \(2^{n}\)
- Efficient enumeration of maximal \(k\)-degenerate subgraphs in a chordal graph
- Efficient enumeration of induced subtrees in a K-degenerate graph
- Enumerating and generating labeled \(k\)-degenerate graphs
This page was built for publication: Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1985603)
