Connecting Terminals and 2-Disjoint Connected Subgraphs

DOI10.1007/978-3-642-45043-3_36zbMath1417.05112arXiv1301.2506OpenAlexW2159973663MaRDI QIDQ2864321

Yngve Villanger, Jan Arne Telle

Publication date: 6 December 2013

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items

Enumerating minimal connected dominating sets in graphs of bounded chordality ⋮ Enumeration of minimal tropical connected sets ⋮ Enumerating Minimal Tropical Connected Sets ⋮ Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) ⋮ Path Contraction Faster than $2^n$ ⋮ Contracting bipartite graphs to paths and cycles ⋮ Unnamed Item ⋮ Contracting bipartite graphs to paths and cycles ⋮ Disjoint paths and connected subgraphs for \(H\)-free graphs ⋮ Disjoint paths and connected subgraphs for \(H\)-free graphs ⋮ Path Contraction Faster Than 2^n