Sciweavers

482 search results - page 6 / 97

» A Linear-Time Graph Kernel

77

Voted

JCSS
2006

61views more JCSS 2006»

Planar graphs, negative weight edges, shortest paths, and near linear time

15 years 3 months ago

Planar graphs, negative weight edges, shortest paths, and near linear time

Download www.math.tu-dresden.de

Jittat Fakcharoenphol, Satish Rao

claim paper

Read More »

90

ALGORITHMICA
2000

75views more ALGORITHMICA 2000»

A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs

15 years 3 months ago

A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs

Download www.ub.uni-konstanz.de

Ulrik Brandes, Dorothea Wagner

claim paper

Read More »

106

IPL
2002

79views more IPL 2002»

4-edge-coloring graphs of maximum degree 3 in linear time

15 years 2 months ago

4-edge-coloring graphs of maximum degree 3 in linear time

Download www.cs.colorado.edu

San Skulrattanakulchai

claim paper

Read More »

89

JCO
2010

56views more JCO 2010»

Linear time construction of 5-phylogenetic roots for tree chordal graphs

15 years 1 months ago

Linear time construction of 5-phylogenetic roots for tree chordal graphs

Download webdocs.cs.ualberta.ca

William S. Kennedy, Hui Kong, Guohui Lin, Guiying ...

claim paper

Read More »

146

Voted

SIAMCOMP
1998

124views more SIAMCOMP 1998»

Near-Linear Time Construction of Sparse Neighborhood Covers

15 years 2 months ago

Near-Linear Time Construction of Sparse Neighborhood Covers

Download www.cs.ust.hk

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...

claim paper

Read More »

« Prev « First page 6 / 97 Last » Next »