Simple vertex ordering characterizations for graph search

DOI10.1016/j.endm.2005.06.061zbMath1200.05220OpenAlexW80120243MaRDI QIDQ3439379

R. Krueger, Derek Gordon Corneil

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.061

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• LexBFS-orderings and powers of chordal graphs
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• A Unified View of Graph Searching
• Algorithmic Aspects of Vertex Elimination on Graphs
• Graph-Theoretic Concepts in Computer Science
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: Simple vertex ordering characterizations for graph search