Search Sciweavers | Sciweavers

643 search results - page 80 / 129

» Supereulerian planar graphs

136

click to vote

SODA
2008
ACM

88views Algorithms» more SODA 2008»

A near-linear time algorithm for computing replacement paths in planar directed graphs

15 years 7 months ago

Download www.wisdom.weizmann.ac.il

Yuval Emek, David Peleg, Liam Roditty

claim paper

Read More »

198

click to vote

DRW
2003

202views Mathematics» more DRW 2003»

Annihilating random walks and perfect matchings of planar graphs

15 years 7 months ago

Download www.univie.ac.at

Massimiliano Mattera

claim paper

Read More »

140

click to vote

SODA
2004
ACM

102views Algorithms» more SODA 2004»

A deterministic near-linear time algorithm for finding minimum cuts in planar graphs

15 years 7 months ago

Download www.cc.gatech.edu

Parinya Chalermsook, Jittat Fakcharoenphol, Danupo...

claim paper

Read More »

click to vote

SODA
2003
ACM

96views Algorithms» more SODA 2003»

Dominating sets in planar graphs: branch-width and exponential speed-up

15 years 7 months ago

Download www.ii.uib.no

Fedor V. Fomin, Dimitrios M. Thilikos

claim paper

Read More »

109

click to vote

PDPTA
2000

84views Distributed And Parallel Com...» more PDPTA 2000»

Coarse Grained Parallel Graph Planarity Testing

15 years 7 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers