scientific article; zbMATH DE number 5279365
From MaRDI portal
Publication:5387667
zbMath1153.05331MaRDI QIDQ5387667
Stavros D. Nikolopoulos, Leonidas Palios
Publication date: 27 May 2008
Full work available at URL: https://eudml.org/doc/129521
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs ⋮ Characterization and recognition of some opposition and coalition graph classes ⋮ Finding a sun in building-free graphs ⋮ An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs ⋮ Induced Embeddings into Hamming Graphs.