A Simple and Fast Approach for Solving Problems on Planar Graphs
- 1 January 2004
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Graph separators: a parameterized viewJournal of Computer and System Sciences, 2003
- A deterministic (2−2/(k+1))n algorithm for k-SAT based on local searchTheoretical Computer Science, 2002
- Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar GraphsAlgorithmica, 2002
- Efficient Data Reduction for Dominating Set: A Linear Problem Kernel for the Planar CaseLecture Notes in Computer Science, 2002
- Vertex Cover: Further Observations and Further ImprovementsJournal of Algorithms, 2001
- Maximum Clique TransversalsLecture Notes in Computer Science, 2001
- Parameterized Complexity: Exponential Speed-Up for Planar Graph ProblemsLecture Notes in Computer Science, 2001
- Planar SeparatorsSIAM Journal on Discrete Mathematics, 1994
- On Linear Time Minor Tests with Depth-First SearchJournal of Algorithms, 1993
- A separator theorem for nonplanar graphsJournal of the American Mathematical Society, 1990