.png){kind=icon}
.png){kind=icon}
Return
A comparison of integer and constraint programming models for the deficiency problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2015.10.016.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
An edge-coloring of a graph G = (V, E) is a function c that assigns an integer c(e) (called color) in {0,1,2, ... } to every edge e e E so that adjacent edges are assigned different colors. An edge-coloring is compact if the colors of the edges incident to every vertex form a set of consecutive integers. The deficiency problem is to determine the minimum number of pendant edges that must be added to a graph such that the resulting graph admits a compact edge-coloring. We propose and analyze three integer programming models and one constraint programming model for the deficiency problem. (C) 2015 Elsevier Ltd. All rights reserved.
Keywords:
Compact edge-colorings
Integer linear programming
Constraint programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W