A simple nc algorithm to recognize weakly triangulated graphs

DOI10.1080/00207168908803775zbMath0679.68129OpenAlexW2005067245MaRDI QIDQ4729374

Stephan Olariu

Publication date: 1989

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168908803775

zbMATH Keywords

parallel algorithmsperfect graphsNC algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel numerical computation (65Y05)

Cites Work

• Unnamed Item
• Unnamed Item
• Weakly triangulated graphs
• An O(logn) parallel connectivity algorithm
• Implementation of simultaneous memory address access in models that forbid it