A simple nc algorithm to recognize weakly triangulated graphs

DOI10.1080/00207168908803775MaRDI QIDQ4729374zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3965452 (Why is no real title available?)
• An O(logn) parallel connectivity algorithm
• Implementation of simultaneous memory address access in models that forbid it
• Weakly triangulated graphs

This page was built for publication: A simple nc algorithm to recognize weakly triangulated graphs

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