A general scheme for deciding the branchwidth

Abstract : We adapt some decision theorems about treewidth to the branchwidth and use this theorems to prove that the branchwidth of circular-arc graphs can be computed in polynomial time.
Document type :
Reports
Complete list of metadatas

Cited literature [2 references]  Display  Hide  Download

https://hal-lara.archives-ouvertes.fr/hal-02102054
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:13:00 AM
Last modification on : Thursday, November 21, 2019 - 2:38:42 AM

File

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

Identifiers

  • HAL Id : hal-02102054, version 1

Collections

Citation

Frédéric Mazoit. A general scheme for deciding the branchwidth. [Research Report] LIP RR-2004-34, Laboratoire de l'informatique du parallélisme. 2004, 2+11p. ⟨hal-02102054⟩

Share

Metrics

Record views

5

Files downloads

7