Sciweavers

641 search results - page 80 / 129
» On Planar Quasi-Parity Graphs
Sort
View
SODA
2004
ACM
102views Algorithms» more  SODA 2004»
15 years 1 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»
15 years 1 months ago
Dominating sets in planar graphs: branch-width and exponential speed-up
Fedor V. Fomin, Dimitrios M. Thilikos
61
Voted
PDPTA
2000
15 years 1 months ago
Coarse Grained Parallel Graph Planarity Testing
Edson Cáceres, Albert Chan, Frank K. H. A. ...
ESA
2010
Springer
138views Algorithms» more  ESA 2010»
15 years 1 months ago
Induced Matchings in Subcubic Planar Graphs
Ross J. Kang, Matthias Mnich, Tobias Müller