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] (2004)

  • Volume: 6, Issue: 2, page 483-496
  • ISSN: 1365-8050

How to cite

top

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 -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.