Optimal chain partitions of trees
From MaRDI portal
Publication:1223159
DOI10.1016/0020-0190(75)90057-5zbMath0321.68029OpenAlexW1993924797MaRDI QIDQ1223159
Jayadev Misra, Robert Endre Tarjan
Publication date: 1975
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(75)90057-5
Related Items (11)
On the \(k\)-path cover problem for cacti ⋮ \(k\)-path partitions in trees ⋮ On the \(k\)-path partition of graphs. ⋮ Path covering number and \(L(2,1)\)-labeling number of graphs ⋮ A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. ⋮ Vertex partitions of \(r\)-edge-colored graphs ⋮ A linear algorithm for the Hamiltonian completion number of a tree ⋮ Linear algorithms on recursive representations of trees ⋮ Chain partitioning as a key element for building vehicle routing problem heuristics ⋮ The approximability of the weighted Hamiltonian path completion problem on a tree ⋮ Approximations to clustering and subgraph problems on trees
Cites Work
This page was built for publication: Optimal chain partitions of trees
