Mixed search number and linear-width of interval and split graphs

Authors:
Fedor V. Fomin;Pinar Heggernes;Rodica Mihai
Affiliations:
Department of Informatics, University of Bergen, Bergen, Norway;Department of Informatics, University of Bergen, Bergen, Norway;Department of Informatics, University of Bergen, Bergen, Norway
Venue:
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Year:
2007

Citing 14
Cited 5

The complexity of searching a graph

Journal of the ACM (JACM)
Computing the bandwidth of interval graphs

SIAM Journal on Discrete Mathematics
Monotonicity in graph searching

Journal of Algorithms
Recontamination does not help to search a graph

Journal of the ACM (JACM)
On the pathwidth of chordal graphs

Discrete Applied Mathematics - ARIDAM IV and V
Mixed searching and proper-path-width

Theoretical Computer Science
Algorithms and obstructions for linear-width and related search parameters

Discrete Applied Mathematics
A survey of graph layout problems

ACM Computing Surveys (CSUR)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
A 3-approximation for the pathwidth of Halin graphs

Journal of Discrete Algorithms
Computing the branchwidth of interval graphs

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
On the interval completion of chordal graphs

Discrete Applied Mathematics
New tools and simpler algorithms for branchwidth

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Optimal linear arrangement of interval graphs

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

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
Edge Search Number of Cographs in Linear Time

FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Edge search number of cographs

Discrete Applied Mathematics
Pathwidth and searching in parameterized threshold graphs

WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the mixed search number and the linear-width of interval graphs and of split graphs can be computed in linear time and in polynomial time, respectively.