Optimal algorithms for computing articulation points and some related problems on a circular-arc graph

DOI10.1016/0167-8191(95)00007-BMaRDI QIDQ673024zbMATH OpenOpenAlexFDO

Authors Tzong-Wann Kao, Shi-Jinn Horng

Publication date 28 February 1997

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(95)00007-b

zbMATH Keywords

Articulation pointBiconnected componentBridgeCircular-arc graphOptimal speed-upParallel algorithm

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 4215389
• Optimal parallel algorithms on circular-arc graphs
• scientific article; zbMATH DE number 140476
• Parallel algorithms on circular-arc graphs

Cited in

(2)

• scientific article; zbMATH DE number 5711694 (Why is no real title available?)
• scientific article; zbMATH DE number 1230492 (Why is no real title available?)

This page was built for publication: Optimal algorithms for computing articulation points and some related problems on a circular-arc graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673024)