scientific article; zbMATH DE number 794265
From MaRDI portal
Publication:4847026
zbMath0849.68037MaRDI QIDQ4847026
Jan Kratochvíl, Paul D. Manuel, Mirka Miller
Publication date: 10 September 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (11)
A Taxonomy of Perfect Domination ⋮ Hereditary Efficiently Dominatable Graphs ⋮ Graph classes with structured neighborhoods and algorithmic applications ⋮ Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity ⋮ On weighted efficient total domination ⋮ Parameterized complexity of generalized domination problems ⋮ Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs ⋮ Independent sets with domination constraints ⋮ Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs ⋮ Graphs that are simultaneously efficient open domination and efficient closed domination graphs ⋮ Graph Classes with Structured Neighborhoods and Algorithmic Applications
This page was built for publication:
