Algorithms and obstructions for linear-width and related search parameters

@article{Thilikos2000AlgorithmsAO,
  title={Algorithms and obstructions for linear-width and related search parameters},
  author={Dimitrios M. Thilikos},
  journal={Discrete Applied Mathematics},
  year={2000},
  volume={105},
  pages={239-271}
}
The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering (e1; : : : ; er) in such a way that for every i = 1; : : : ; r 1, there are at most k vertices incident to edges that belong both to fe1; : : : ; eig and to fei+1; : : : ; erg. In this paper, we give a set of 57 graphs and prove that it is the set of the minimal forbidden minors for the class of graphs with linear-width at most two. Our proof also gives a linear… CONTINUE READING
28 Citations
34 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 34 references

Minimal forbidden minors for the family of graphs with prope-path-width at most two

  • A. Takahashi, S. Ueno, Y. Kajitani
  • IEICE Trans. Fundamentals,
  • 1995
Highly Influential
4 Excerpts

On nding obstruction sets and polynomial-time algorithms for gate matrix layout

  • R. L. Bryant, M. R. Fellows, N. G. Kinnersley, M. A. Langston
  • In Proc. 25th Allerton Conf. on Communication…
  • 1987
Highly Influential
1 Excerpt

Algorithms for Graphs of Small Treewidth

  • B. de Fluiter
  • PhD thesis, Utrecht University,
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…