scientific article; zbMATH DE number 1830756
From MaRDI portal
Publication:4778579
zbMath0997.68087MaRDI QIDQ4778579
Publication date: 18 November 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2125/21250462
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (5)
Path Problems in Complex Networks ⋮ Vertex coloring of a graph for memory constrained scenarios ⋮ An exact algorithm for the channel assignment problem ⋮ Approximation of min coloring by moderately exponential algorithms ⋮ Efficiency in exponential time for domination-type problems
This page was built for publication:
