66 search results - page 3 / 14 » Planar graph bipartization in linear time |
159
click to vote
SIAMCOMP
1998
15 years 4 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
15 years 4 months ago
2006
143
click to vote
DM
2007
15 years 4 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...
124
Voted
TAMC
2009
Springer
15 years 11 months 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...