Listing all the minimal separators of a 3-connected planar graph.

Abstract : I present an efficient algorithm which lists the minimal separators of a 3-connected planar graph in $O(n)$ per separator.
Document type :
Reports
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal-lara.archives-ouvertes.fr/hal-02102052
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:12:58 AM
Last modification on : Sunday, May 5, 2019 - 1:24:46 AM

File

RR2004-05.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02102052, version 1

Collections

Citation

Frédéric Mazoit. Listing all the minimal separators of a 3-connected planar graph.. [Research Report] LIP RR-2004-05, Laboratoire de l'informatique du parallélisme. 2004, 2+8p. ⟨hal-02102052⟩

Share

Metrics

Record views

9

Files downloads

33