On the directed degree-preserving spanning tree problem

DOI10.1007/978-3-642-11269-0_23MaRDI QIDQ3656869zbMATH OpenOpenAlexFDO

Authors Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar

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

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

Recommendations

• On the directed full degree spanning tree problem
• Degree-preserving spanning trees in small-degree graphs
• Parameterized Algorithms for Directed Maximum Leaf Problems
• Fixed-parameter tractability results for full-degree spanning tree and its dual
• scientific article; zbMATH DE number 2081108

Cites work

• A Moderately Exponential Time Algorithm for Full Degree Spanning Tree
• Easy problems for tree-decomposable graphs
• Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs
• scientific article; zbMATH DE number 1507224 (Why is no real title available?)
• scientific article; zbMATH DE number 1563034 (Why is no real title available?)
• scientific article; zbMATH DE number 1420489 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• On Local Search and Placement of Meters in Networks
• On the directed degree-preserving spanning tree problem
• Parametrized complexity theory.

Cited in

(7)

• Degree-preserving spanning trees in small-degree graphs
• Complexity of the directed spanning cactus problem
• Balanced branchings in digraphs
• The complexity of finding arc-disjoint branching flows
• Fixed-parameter tractability results for full-degree spanning tree and its dual
• On the directed degree-preserving spanning tree problem
• On the directed full degree spanning tree problem

This page was built for publication: On the directed degree-preserving spanning tree problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3656869)