On the minimum caterpillar problem in digraphs

DOI10.1007/978-3-642-38768-5_66MaRDI QIDQ4925290zbMATH OpenOpenAlexFDO

Authors Taku Okada, Akira Suzuki, Takehiro Ito, Xiao Zhou

Publication date 11 June 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs
• Upper and lower bounding procedures for the minimum caterpillar spanning problem
• On caterpillar factors in graphs
• On complexity of minimum leaf out-branching problem
• Complexity of the directed spanning cactus problem

Cited in

(3)

• Upper and lower bounding procedures for the minimum caterpillar spanning problem
• The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
• scientific article; zbMATH DE number 6402478 (Why is no real title available?)

This page was built for publication: On the minimum caterpillar problem in digraphs

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