Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Reports

Listing all the minimal separators of a planar graph.

Frédéric Mazoit 1 
1 LIP - Laboratoire de l'Informatique du Parallélisme
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
Document type :
Reports
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download
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

File

Vignette du document
RR2004-35.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02102065, version 1

Collections

ENS-LYON | CNRS | INRIA | UNIV-LYON1 | LARA | UDL

Citation

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

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

7

Files downloads

27

INIST-CNRS Institut de l’information scientifique et technique |

hal-lara@inist.fr

Contact

 

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr