An nc algorithm to recognize hhd-free graphs

DOI10.1080/00207169008803800zbMath0825.68484OpenAlexW2110952009MaRDI QIDQ4009712

Stephan Olariu

Publication date: 27 September 1992

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

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Powers of hhd-free graphs^∗, Duchet-type theorems for powers of HHD-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• Welsh-Powell opposition graphs
• On the semi-perfect elimination
• Four classes of perfectly orderable graphs
• NC algorithms for recognizing chordal graphs and k trees
• An O(logn) parallel connectivity algorithm
• Algorithmic Aspects of Vertex Elimination on Graphs
• The Parallel Evaluation of General Arithmetic Expressions
• Implementation of simultaneous memory address access in models that forbid it