The pathwidth and treewidth of cographs

Hans Bodlaender, Rolf H. Möhring

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

Abstract

It is shown that the pathwidth of a cograph equals its treewidth, and a linear time algorithm to determine the pathwidth of a the cograph and build a corresponding path-decomposition is given.
Original languageEnglish
Title of host publicationSWAT 90
Subtitle of host publication2nd Scandinavian Workshop on Algorithm Theory Bergen, Sweden, July 11–14, 1990 Proceedings
EditorsJohn R. Gilbert, Rolf Karlsson
PublisherSpringer
Pages301-309
Number of pages9
Volume447
ISBN (Electronic)978-3-540-47164-6
ISBN (Print)978-3-540-52846-3
DOIs
Publication statusPublished - 1990
Externally publishedYes

Publication series

NameLecture Notes in Computer Science

Fingerprint

Dive into the research topics of 'The pathwidth and treewidth of cographs'. Together they form a unique fingerprint.

Cite this