SODA 2004
A deterministic near-linear time algorithm for finding minimum cuts in planar graphs
Abstract
No abstract is available in the live database for this paper.
Authors
Keywords
No keywords are indexed for this paper.
Context
- Venue
- ACM-SIAM Symposium on Discrete Algorithms
- Archive span
- 1990-2025
- Indexed papers
- 4674
- Paper id
- 782884310927324489