 |
HAL-LARA Libre accès aux rapports scientifiques et techniques |
 |
Reports
Listing all the minimal separators of a planar graph.
Abstract : I present an efficient algorithm which lists the minimal separators of a planar graph in O(n) per separator.
Keywords :
Minimal Separator Enumeration
Planar Graphs
Cited literature [10 references]
https://hal-lara.archives-ouvertes.fr/hal-02102065
Contributor : Colette Orange Connect in order to contact the contributor
Submitted on : Wednesday, April 17, 2019 - 9:13:24 AM
Last modification on : Saturday, September 11, 2021 - 3:19:11 AM
Contributor : Colette Orange Connect in order to contact the contributor
Submitted on : Wednesday, April 17, 2019 - 9:13:24 AM
Last modification on : Saturday, September 11, 2021 - 3:19:11 AM
File
RR2004-35.pdf
Files produced by the author(s)
