scientific article; zbMATH DE number 4210190

zbMATH Open0732.05050MaRDI QIDQ3358770FDOQ3358770

Authors: Janez Žerovnik 

Publication date: 1989

Title of this publication is not available (Why is that?)

Recommendations

• A randomised heuristical algorithm for estimating the chromatic number of a graph
• A parallel variant of a heuristical algorithm for graph colouring
• Algorithms for Colouring Random k-colourable Graphs
• A randomized algorithm for \(k\)-colorability
• scientific article; zbMATH DE number 4134072

zbMATH Keywords

antivoter modelinitial vertex colouringrandomized graph colouring algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Cited In (12)

• Evolutionary Computation in Combinatorial Optimization
• A randomised heuristical algorithm for estimating the chromatic number of a graph
• A semidefinite programming-based heuristic for graph coloring
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph Coloring Using Eigenvalue Decomposition
• A fresh look at a randomized massively parallel graph coloring algorithm
• A parallel variant of a heuristical algorithm for graph colouring
• Title not available (Why is that?)
• A recolouring problem on undirected graphs
• Improving graph colouring algorithms and heuristics using a novel representation
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3358770)