Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time
From MaRDI portal
Publication:4420425
DOI10.1016/S0196-6774(02)00225-0zbMath1053.68072OpenAlexW2063778405MaRDI QIDQ4420425
Publication date: 17 August 2003
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0196-6774(02)00225-0
Related Items (16)
Edge Search Number of Cographs in Linear Time ⋮ Pathwidth is NP-Hard for Weighted Trees ⋮ Outerplanar obstructions for matroid pathwidth ⋮ Mixed Search Number of Permutation Graphs ⋮ Edge search number of cographs ⋮ Pathwidth of Circular-Arc Graphs ⋮ A distributed algorithm for computing the node search number in trees ⋮ An annotated bibliography on guaranteed graph searching ⋮ A 3-approximation for the pathwidth of Halin graphs ⋮ A 3-approximation for the pathwidth of Halin graphs ⋮ Exclusive graph searching ⋮ Exclusive graph searching vs. pathwidth ⋮ Graph classes and the switch Markov chain for matchings ⋮ 2-connecting outerplanar graphs without blowing up the pathwidth ⋮ Non-deterministic graph searching in trees ⋮ Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth
This page was built for publication: Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time
