Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4651432 | Discrete Mathematics | 2006 | 9 Pages |
Abstract
We present an efficient algorithm that lists the minimal separators of a 3-connected planar graph in O(n)O(n) per separator.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
F. Mazoit,