Evaluation of Metaheuristics for Robust Graph Coloring Problem

Zbigniew Kokosiński; Łukasz Ochał

doi:10.15439/2015f293

ScienceGate Book Chapters

JOURNAL ARTICLE

Evaluation of Metaheuristics for Robust Graph Coloring Problem

Zbigniew Kokosiński Łukasz Ochał

Year: 2015 Journal: Annals of Computer Science and Information Systems Vol: 5 Pages: 519-524 Publisher: Polskie Towarzystwo Informatyczne

DOI: 10.15439/2015f293

Get Full-Text PDF Get Analytical Report

Abstract

In this paper a new formulation of the robust graph coloring problem (RGCP) is proposed. In opposition to classical GCP defined for the given graph G(V,E) not only elements of E but also E can be subject of color conflicts in edge vertices. Conflicts in E are assigned penalties 0

Keywords:

Fractional coloring Graph coloring Combinatorics List coloring Chromatic scale Graph Mathematics Upper and lower bounds Discrete mathematics Computer science Graph power Line graph

Metrics

Cited By

0.40

FWCI (Field Weighted Citation Impact)

Refs

0.50

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Scheduling and Timetabling Solutions

Social Sciences → Decision Sciences → Management Science and Operations Research

Vehicle Routing Optimization Methods

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Optimization and Mathematical Programming

Physical Sciences → Engineering → Control and Systems Engineering

Evaluation of Metaheuristics for Robust Graph Coloring Problem

Abstract

Metrics

Citation History

Topics

Related Documents

Parallel Metaheuristics for Robust Graph Coloring Problem

Metaheuristics for robust graph coloring

The Fuzzy Robust Graph Coloring Problem

Efficient and Robust Graph Coloring Algorithm for Graph Coloring Problem: Malatya Vertex Coloring Algorithm

Meta-heuristics for robust graph coloring problem