Sciweavers

643 search results - page 80 / 129
» Supereulerian planar graphs
Sort
View
SODA
2004
ACM
102views Algorithms» more  SODA 2004»
13 years 11 months ago
A deterministic near-linear time algorithm for finding minimum cuts in planar graphs
Parinya Chalermsook, Jittat Fakcharoenphol, Danupo...
SODA
2003
ACM
96views Algorithms» more  SODA 2003»
13 years 11 months ago
Dominating sets in planar graphs: branch-width and exponential speed-up
Fedor V. Fomin, Dimitrios M. Thilikos
PDPTA
2000
13 years 11 months ago
Coarse Grained Parallel Graph Planarity Testing
Edson Cáceres, Albert Chan, Frank K. H. A. ...