Graph separators: a parameterized view

@article{Alber2003GraphSA,
  title={Graph separators: a parameterized view},
  author={Jochen Alber and Henning Fernau and Rolf Niedermeier},
  journal={J. Comput. Syst. Sci.},
  year={2003},
  volume={67},
  pages={808-832}
}
Graph separation is a well-known tool to make (hard) graph problems accessible to a divide-and-conquer approach. We show how to use graph separator theorems in combination with (linear) problem kernels in order to develop fixed parameter algorithms for many wellknown NP-hard (planar) graph problems. We coin the key notion of glueable select&verify graph problems and derive from that a prospective way to easily check whether a planar graph problem will allow for a fixed parameter algorithm of… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Redu ed onstants for simple y le graph sepa ration

  • H. N. Djidjev, S. Venkatesan
  • A ta Informati a, 34:231{243,
  • 1997

A separator theorem for graphs of xed genus

  • H. N. Djidjev
  • Serdi a, 11:319{329,
  • 1985

Appli ations of a planar separator theorem

  • R. J. Lipton, R. E. Tarjan
  • SIAM J. Comput., 9(3):615{627,
  • 1980

Similar Papers

Loading similar papers…