Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5897578
DOI10.1007/11604686zbMath1123.68096MaRDI QIDQ5897578
Stavros D. Nikolopoulos, Leonidas Palios
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
recognitionperfectly orderable graphssunHHD-free graphshomogeneously orderable graphsHHDS-free graphs
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 (2)
An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs ⋮ Finding a sun in building-free graphs
This page was built for publication: Graph-Theoretic Concepts in Computer Science