66 search results - page 3 / 14 » Planar graph bipartization in linear time |
SIAMCOMP
1998
13 years 5 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
JCSS
2006
13 years 5 months ago
2006
ALGORITHMICA
2000
13 years 5 months ago
2000
DM
2007
13 years 5 months ago
2007
In this paper it is shown that a class of almost-median graphs that includes all planar almost-median graphs can be recognized in O(m log n) time, where n denotes the number of ve...
TAMC
2009
Springer
14 years 3 days ago
2009
Springer
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set pr...