Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs

DOI10.1007/978-3-642-23719-5_24zbMath1346.05282OpenAlexW2112688802MaRDI QIDQ3092236

Rui Ferreira, Roberto Grossi, Romeo Rizzi

Publication date: 16 September 2011

Published in: Algorithms – ESA 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23719-5_24

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Constant Time Enumeration by Amortization ⋮ On the Position Value for Special Classes of Networks

This page was built for publication: Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs