Graph separator algorithms: A refined analysis

MaRDI QIDQ4414496zbMATH OpenFDO

Authors Henning Fernau

Publication date 25 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2573/25730186.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Graph separators, with applications
• scientific article; zbMATH DE number 4062622
• scientific article; zbMATH DE number 4091555
• Exact algorithms for the vertex separator problem in graphs
• scientific article; zbMATH DE number 1942408
• Efficient splitting off algorithms for graphs
• Weighted graph separators and their applications
• Parameterized and Exact Computation
• Parameterized graph separation problems
• Graph separators: A parameterized view

Cited in

(9)

• Graph separators: A parameterized view
• Exact algorithms for the vertex separator problem in graphs
• scientific article; zbMATH DE number 4091555 (Why is no real title available?)
• scientific article; zbMATH DE number 16297 (Why is no real title available?)
• An approach to emulating separable graphs
• Graph separators: A parameterized view
• An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications
• Confronting intractability via parameters
• Coverability and sub-exponential parameterized algorithms in planar graphs

This page was built for publication: Graph separator algorithms: A refined analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414496)