Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph

DOI10.1007/978-3-319-13075-0_8zbMath1435.05109arXiv1407.6140OpenAlexW1515705512MaRDI QIDQ2942617

Kunihiro Wasa, Takeaki Uno, Hiroki Arimura

Publication date: 11 September 2015

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.6140

zbMATH Keywords

\(k\)-degenerate graphssubgraphs enumeration

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Efficient enumeration of dominating sets for sparse graphs ⋮ Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph ⋮ Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs ⋮ Unnamed Item ⋮ A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number

This page was built for publication: Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph