Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time

Authors:
Konstantin Skodinis
Affiliations:
Department of Computer Science, University of Passau, D-94032 Passau, Germany
Venue:
Journal of Algorithms
Year:
2003

Citing 14
Cited 16

Polynomial time algorithms for the min cut problem on degree restricted trees

SIAM Journal on Computing
A polynomial algorithm for the min-cut linear arrangement of trees

Journal of the ACM (JACM)
Searching and pebbling

Theoretical Computer Science
The complexity of searching a graph

Journal of the ACM (JACM)
Min cut is NP-complete for edge weighted trees

Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
On minimizing width in linear layouts

Discrete Applied Mathematics
The vertex separation number of a graph equals its path-width

Information Processing Letters
Recontamination does not help to search a graph

Journal of the ACM (JACM)
The pathwidth and treewidth of cographs

SIAM Journal on Discrete Mathematics
On the pathwidth of chordal graphs

Discrete Applied Mathematics - ARIDAM IV and V
The vertex separation and search number of a graph

Information and Computation
Treewidth and Pathwidth of Permutation Graphs

SIAM Journal on Discrete Mathematics
Efficient and constructive algorithms for the pathwidth and treewidth of graphs

Journal of Algorithms
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing

Cutwidth II: algorithms for partial w-trees of bounded degree

Journal of Algorithms
A 3-approximation for the pathwidth of Halin graphs

Journal of Discrete Algorithms
An annotated bibliography on guaranteed graph searching

Theoretical Computer Science
Mixed Search Number of Permutation Graphs

FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
A Distributed Algorithm for Computing and Updating the Process Number of a Forest

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Computing and Updating the Process Number in Trees

OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Edge Search Number of Cographs in Linear Time

FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Pathwidth is NP-Hard for Weighted Trees

FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Reconfiguration of the routing in WDM networks with two classes of services

ONDM'09 Proceedings of the 13th international conference on Optical Network Design and Modeling
A Self-stabilizing Algorithm for Graph Searching in Trees

SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Cutwidth II: Algorithms for partial w-trees of bounded degree

Journal of Algorithms
Treewidth: structure and algorithms

SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Pathwidth of circular-arc graphs

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Efficient self-stabilizing graph searching in tree networks

SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Graph searching and search time

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Edge search number of cographs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a linear time algorithm which, given a tree, computes a linear layout optimal with respect to vertex separation. As a consequence optimal edge search strategies, optimal node search strategies, and optimal interval augmentations can be computed also in O(n) for trees. This improves the running time of former algorithms from O(n log n) to O(n) and answers the open questions raised in [Ellis et al., Inform. Comput. 113 (1994) 50-79, Megiddo, J. Assoc. Comput. Mach. 35 (1) (1988) 18-44].