Mixed Search Number and Linear-Width of Interval and Split Graphs
From MaRDI portal
Publication:3508577
Cites work
- A 3-approximation for the pathwidth of Halin graphs
- A Characterization of Comparability Graphs and of Interval Graphs
- Algorithmic graph theory and perfect graphs
- Algorithms and obstructions for linear-width and related search parameters
- Algorithms – ESA 2005
- Computing the Bandwidth of Interval Graphs
- Computing the branchwidth of interval graphs
- Graph searching on some subclasses of chordal graphs
- scientific article; zbMATH DE number 1696538 (Why is no real title available?)
- scientific article; zbMATH DE number 176249 (Why is no real title available?)
- scientific article; zbMATH DE number 3590298 (Why is no real title available?)
- Interval graphs and searching
- Mixed searching and proper-path-width
- Monotonicity in graph searching
- On the interval completion of chordal graphs
- On the pathwidth of chordal graphs
- Optimal Linear Arrangement of Interval Graphs
- Recontamination does not help to search a graph
- Some generalizations of the problem on the search number of a graph
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The complexity of searching a graph
- The theory of search games and rendezvous.
Cited in
(5)
This page was built for publication: Mixed Search Number and Linear-Width of Interval and Split Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3508577)