An nc algorithm to recognize hhd-free graphs

DOI10.1080/00207169008803800MaRDI QIDQ4009712zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• Algorithmic Aspects of Vertex Elimination on Graphs
• An O(logn) parallel connectivity algorithm
• Four classes of perfectly orderable graphs
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3965452 (Why is no real title available?)
• Implementation of simultaneous memory address access in models that forbid it
• NC algorithms for recognizing chordal graphs and k trees
• On rigid circuit graphs
• On the semi-perfect elimination
• The Parallel Evaluation of General Arithmetic Expressions
• Welsh-Powell opposition graphs

Cited in

(2)

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

This page was built for publication: An nc algorithm to recognize hhd-free graphs

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