scientific article; zbMATH DE number 2226810
From MaRDI portal
Publication:5705147
zbMath1079.68076MaRDI QIDQ5705147
Publication date: 8 November 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (10)
Edge coloring of graphs, uses, limitation, complexity ⋮ A review on algorithms for maximum clique problems ⋮ Reducing graph coloring to clique search ⋮ Coloring the nodes of a directed graph ⋮ On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes ⋮ An Extended Comparison of the Best Known Algorithms for Finding the Unweighted Maximum Clique ⋮ A clique search problem and its application to machine scheduling ⋮ Estimating clique size by coloring the nodes of auxiliary graphs ⋮ Numerical experiments with LP formulations of the maximum clique problem ⋮ Coloring the edges of a directed graph
Uses Software
This page was built for publication:
