Optimal sequential and parallel algorithms for cut vertices and bridges on trapezoid graphs.
Chen, Hon-Chan
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only], Tome 6 (2004), p. 483-496 / Harvested from The Electronic Library of Mathematics
Publié le : 2004-01-01
EUDML-ID : urn:eudml:doc:124870
@article{02159654,
     title = {Optimal sequential and parallel algorithms for cut vertices and bridges on trapezoid graphs.},
     journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
     volume = {6},
     year = {2004},
     pages = {483-496},
     zbl = {1066.68094},
     language = {en},
     url = {http://dml.mathdoc.fr/item/02159654}
}
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], Tome 6 (2004) pp. 483-496. http://gdmltest.u-ga.fr/item/02159654/