Optimal sequential and parallel algorithms to compute all cut vertices on trapezoid graphs

DOI10.1023/B:COAP.0000004982.13444.BCzbMath1045.90073MaRDI QIDQ1424795

Mrinmoy Hota, Madhumangal Pal, Tapan Kumar Pal

Publication date: 15 March 2004

Published in: Computational Optimization and Applications (Search for Journal in Brave)

zbMATH Keywords

blocktrapezoid graphparallel algorithmcut vertexdesign and analysis of algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (2)

Efficient algorithm for the vertex connectivity of trapezoid graphs ⋮ Counting the number of vertex covers in a trapezoid graph

This page was built for publication: Optimal sequential and parallel algorithms to compute all cut vertices on trapezoid graphs