On the Directed Degree-Preserving Spanning Tree Problem

DOI10.1007/978-3-642-11269-0_23zbMath1273.68182OpenAlexW73258514MaRDI QIDQ3656869

Saket Saurabh, Daniel Lokshtanov, Somnath Sikdar, Venkatesh Raman

Publication date: 14 January 2010

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11269-0_23

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

The complexity of finding arc-disjoint branching flows ⋮ On the Directed Degree-Preserving Spanning Tree Problem ⋮ Balanced branchings in digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parametrized complexity theory.
• Easy problems for tree-decomposable graphs
• Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs
• A Moderately Exponential Time Algorithm for Full Degree Spanning Tree
• On the Directed Degree-Preserving Spanning Tree Problem
• On Local Search and Placement of Meters in Networks

This page was built for publication: On the Directed Degree-Preserving Spanning Tree Problem