An exact method for graph coloring-Reference-Cited by-同舟云学术

An exact method for graph coloring

Published:2006-08 Issue:8 Volume:33 Page:2189-2207
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Lucet C.,Mendes F.,Moukrim A.

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modeling and Simulation,General Computer Science

Reference27 articles.

1. Graph minors. ii. Algorithmic aspects of tree-width;Robertson;Journal of Algorithms,1986

2. A tourist guide through treewidth;Bodlaender;Acta Cybernetica,1993

3. A decomposition algorithm for network reliability evaluation;Carlier;Discrete Applied Mathematics,1996

4. Lucet C. Méthode de décomposition pour l’évaluation de la fiabilité des réseaux. PhD thesis, Université de Technologie de Compiègne, 1993.

5. Manouvrier J. Méthode de décomposition pour résoudre des problèmes combinatoires sur les graphes. PhD thesis, Université de Technologie de Compiègne, 1998.

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022;ACM Journal of Experimental Algorithmics;2023-08-11

2. Integer Programming Approach to Graph Colouring Problem and Its Implementation in GAMS;WSEAS TRANSACTIONS ON SYSTEMS;2023-05-26

3. Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring;ACM Journal of Experimental Algorithmics;2023-05-11

4. A segment-graph algorithm for two-objective wireless spectrum allocation in cognitive networks;Computer Communications;2021-01

5. An Approach for Solving the Graph Coloring Problem using Adjacency Matrix;2019 8th International Conference System Modeling and Advancement in Research Trends (SMART);2019-11