Optimal sequential and parallel algorithms for cut vertices and bridges on trapezoid graphs.

Chen, Hon-Chan. "Optimal sequential and parallel algorithms for cut vertices and bridges on trapezoid graphs.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 6.2 (2004): 483-496. <http://eudml.org/doc/124870>.

@article{Chen2004,
author = {Chen, Hon-Chan},
journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
keywords = {cut vertex; bridge; trapezoid graph; algorithm},
language = {eng},
number = {2},
pages = {483-496},
publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
title = {Optimal sequential and parallel algorithms for cut vertices and bridges on trapezoid graphs.},
url = {http://eudml.org/doc/124870},
volume = {6},
year = {2004},
}

TY - JOUR
AU - Chen, Hon-Chan
TI - Optimal sequential and parallel algorithms for cut vertices and bridges on trapezoid graphs.
JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY - 2004
PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL - 6
IS - 2
SP - 483
EP - 496
LA - eng
KW - cut vertex; bridge; trapezoid graph; algorithm
UR - http://eudml.org/doc/124870
ER -