An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs

DOI10.1007/s00373-007-0706-3zbMath1123.68089OpenAlexW2083976285MaRDI QIDQ2373437

Chính T. Hoàng, R. Sritharan, Elaine M. Eschen

Publication date: 19 July 2007

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-007-0706-3

zbMATH Keywords

GraphRecognition algorithmhhds-freePerfectly orderable

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Finding a sun in building-free graphs

Cites Work

• Unnamed Item
• On rigid circuit graphs
• On the complexity of recognizing perfectly orderable graphs
• Characterizations of strongly chordal graphs
• On the semi-perfect elimination
• Doubly Lexical Orderings of Matrices
• On brittle graphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• Graph Classes: A Survey
• Graph-Theoretic Concepts in Computer Science
• Finding houses and holes in graphs