Title of article
Planar graph bipartization in linear time Original Research Article
Author/Authors
Samuel Fiorini، نويسنده , , Nadia Hardy، نويسنده , , Bruce Reed، نويسنده , , Adrian Vetta، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
6
From page
1175
To page
1180
Abstract
For each constant k, we present a linear time algorithm that, given a planar graph G, either finds a minimum odd cycle vertex transversal in G or guarantees that there is no transversal of size at most k.
Keywords
Odd cycle , Linear time algorithm , Planar graph
Journal title
Discrete Applied Mathematics
Serial Year
2008
Journal title
Discrete Applied Mathematics
Record number
886728
Link To Document