Sciweavers

482 search results - page 6 / 97
» A Linear-Time Graph Kernel
Sort
View
124
Voted
JCSS
2006
61views more  JCSS 2006»
15 years 6 months ago
Planar graphs, negative weight edges, shortest paths, and near linear time
Jittat Fakcharoenphol, Satish Rao
138
Voted
IPL
2002
79views more  IPL 2002»
15 years 6 months ago
4-edge-coloring graphs of maximum degree 3 in linear time
San Skulrattanakulchai
JCO
2010
56views more  JCO 2010»
15 years 5 months ago
Linear time construction of 5-phylogenetic roots for tree chordal graphs
William S. Kennedy, Hui Kong, Guohui Lin, Guiying ...
182
Voted
SIAMCOMP
1998
124views more  SIAMCOMP 1998»
15 years 6 months ago
Near-Linear Time Construction of Sparse Neighborhood Covers
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)...
Baruch Awerbuch, Bonnie Berger, Lenore Cowen, Davi...