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

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

Outerplanar Graph
Graph in graph theory
Partial K-tree
Halin Graph
Series-parallel Graph
Maximal Independent Set
Depth-first Search
Bounded Treewidth
Search Trees
Decomposable
Complete Graph
Face

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

Parallel complexity of lexicographically first problems for tree-structured graphs. / Chlebus, Bogdan; Diks, Krzysztof; Rytter, Wojciech; Szymacha, Tomasz.

Mathematical Foundations of Computer Science 1989, Proceedings. ed. / Antoni Kreczmar; Grazyna Mirkowska. Springer Verlag, 1989. p. 185-195 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 379 LNCS).

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

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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 379 LNCS, Springer Verlag, pp. 185-195, 14th Symposium on Mathematical Foundations of Computer Science, MFCS 1989, Porabka-Kozubnik, Poland, 8/28/89. https://doi.org/10.1007/3-540-51486-4_66
Chlebus B, Diks K, Rytter W, Szymacha T. Parallel complexity of lexicographically first problems for tree-structured graphs. In Kreczmar A, Mirkowska G, editors, Mathematical Foundations of Computer Science 1989, Proceedings. Springer Verlag. 1989. p. 185-195. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-51486-4_66
Chlebus, Bogdan ; Diks, Krzysztof ; Rytter, Wojciech ; Szymacha, Tomasz. / Parallel complexity of lexicographically first problems for tree-structured graphs. Mathematical Foundations of Computer Science 1989, Proceedings. editor / Antoni Kreczmar ; Grazyna Mirkowska. Springer Verlag, 1989. pp. 185-195 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{c310b0a56f834e55bc00009c0345d8b8,
title = "Parallel complexity of lexicographically first problems for tree-structured graphs",
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.",
author = "Bogdan Chlebus and Krzysztof Diks and Wojciech Rytter and Tomasz Szymacha",
year = "1989",
month = "1",
day = "1",
doi = "10.1007/3-540-51486-4_66",
language = "English (US)",
isbn = "9783540514862",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "185--195",
editor = "Antoni Kreczmar and Grazyna Mirkowska",
booktitle = "Mathematical Foundations of Computer Science 1989, Proceedings",

}

TY - GEN

T1 - Parallel complexity of lexicographically first problems for tree-structured graphs

AU - Chlebus, Bogdan

AU - Diks, Krzysztof

AU - Rytter, Wojciech

AU - Szymacha, Tomasz

PY - 1989/1/1

Y1 - 1989/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0041480792&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0041480792&partnerID=8YFLogxK

U2 - 10.1007/3-540-51486-4_66

DO - 10.1007/3-540-51486-4_66

M3 - Conference contribution

AN - SCOPUS:0041480792

SN - 9783540514862

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 185

EP - 195

BT - Mathematical Foundations of Computer Science 1989, Proceedings

A2 - Kreczmar, Antoni

A2 - Mirkowska, Grazyna

PB - Springer Verlag

ER -