Split-Decomposition Trees with Prime Nodes: Enumeration and Random Generation of Cactus Graphs

DOI10.1137/1.9781611975062.13zbMath1429.05098arXiv1711.10647OpenAlexW2771394889MaRDI QIDQ5195114

Maryam Bahrani, Jérémie Lumbroso

Publication date: 18 September 2019

Published in: 2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30)

Related Items (2)

Exact-Size Sampling of Enriched Trees in Linear Time ⋮ Enumerations, forbidden subgraph characterizations, and the split-decomposition

This page was built for publication: Split-Decomposition Trees with Prime Nodes: Enumeration and Random Generation of Cactus Graphs