Splitting trees at vertices

DOI10.1016/J.DISC.2010.09.024MaRDI QIDQ616363zbMATH OpenOpenAlexFDO

Authors Jens Vygen

Publication date 7 January 2011

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2010.09.024

Mathematics Subject Classification ID

Trees (05C05)

Cites work

• A Faster Algorithm for the Steiner Tree Problem
• A partial k-arboretum of graphs with bounded treewidth
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• Easy problems for tree-decomposable graphs
• scientific article; zbMATH DE number 2104823 (Why is no real title available?)
• scientific article; zbMATH DE number 1424547 (Why is no real title available?)

Cited in

(2)

• Tree partitioning via vertex deletion
• Lazy tree splitting

This page was built for publication: Splitting trees at vertices

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