Parallel complexity of lexicographically first problems for tree-structured graphs

Bogdan Chlebus, Krzysztof Diks, Wojciech Rytter, Tomasz Szymacha

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

We study several P-complete graph problems and show that they are in NC if the input graphs are restricted to be tree-structured. These graphs are also known as partial k-trees, decomposable graphs or graphs of bounded tree width, and include outerplanar graphs, series-parallel graphs and Halin graphs. The particular problems investigated herein include the lexicographically first (l.f.) depth-first search tree and the l.f. maximal independent set. It is also shown that if a tree of faces of an outerplanar graph is given, then its dfs tree can be found in O(log2n) time using O(n/log2n) processors.

Original languageEnglish (US)
Title of host publicationMathematical Foundations of Computer Science 1989, Proceedings
EditorsAntoni Kreczmar, Grazyna Mirkowska
PublisherSpringer Verlag
Pages185-195
Number of pages11
ISBN (Print)9783540514862
DOIs
StatePublished - Jan 1 1989
Externally publishedYes
Event14th Symposium on Mathematical Foundations of Computer Science, MFCS 1989 - Porabka-Kozubnik, Poland
Duration: Aug 28 1989Sep 1 1989

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume379 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th Symposium on Mathematical Foundations of Computer Science, MFCS 1989
CountryPoland
CityPorabka-Kozubnik
Period8/28/899/1/89

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Chlebus, B., Diks, K., Rytter, W., & Szymacha, T. (1989). Parallel complexity of lexicographically first problems for tree-structured graphs. In A. Kreczmar, & G. Mirkowska (Eds.), Mathematical Foundations of Computer Science 1989, Proceedings (pp. 185-195). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 379 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-51486-4_66