This paper deals with the problem of coloring a two-dimensional segmentation result in such a way that each segment has a different color with the constraint that adjacent segments have sufficiently distinct colors to be easily distinguishable by a human viewer. Our solution for this problem is based on a balanced coloring of the neighborhood graph built from the area Voronoi diagram. The balan...

This paper presents a Constraint Programming-based Column Generation approach to the Minimum Graph Coloring problem. The proposed approach has two versions of the pricing subproblems: the first version formulates the pricing subproblem as the optimization problem of finding the most negative reduced cost column, the second version as the decision problem of finding a maximal stable set with neg...

an acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. the acyclic chromatic index of a graph $g$ denoted by $chi_a '(g)$ is the minimum number $k$ such that there is an acyclic edge coloring using $k$ colors. the maximum degree in $g$ denoted by $delta(g)$, is the lower bound for $chi_a '(g)$. $p$-cuts introduced in this paper acts as a powerfu...

Message passing algorithms are popular in many combinatorial optimization problems. Forexample, experimental results show that survey propagation (a certain message passing algorithm)is effective in finding proper k-colorings of random graphs in the near-threshold regime. Gallagerin 1962 introduced the concept of Low Density Parity Check (LDPC) codes, and suggested asimple d...

We extend the work of Abe in [?], to show that the strong partition relation C → (n+ 2) <−reg, for every C ∈ WNS ∗ κ,λ, is a consequence of the existence of an n-subtle cardinal. We then build on Kanamori’s result in [?], that the existence of an n-subtle cardinal is equivalent to the existence of a set of ordinals containing a homogeneous subset of size n + 2 for each regressive coloring of n+...

We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3-list-coloring. Our algorithms are based on a constraint satisfaction (CSP) formulation of these problems. 3-SAT is equivalent to (2, 3)-CSP while the other problems above are special cases of (3, 2)-CSP; there is also a natural duality transformation from (a, b)-CSP to (b, a)-CSP. We ...

Reo is an exogenous coordination model for software components. The informal semantics of Reo has been matched by several proposals of formalization, exploiting co-algebraic techniques, constraint-automata, and coloring tables. We aim to show that the Tile Model offers a flexible and adequate semantic setting for Reo, such that: (i) it is able to capture context-aware behavior; (ii) it is equip...

Cognitive radio networks spectrum access, which allows secondary users opportunistically access unused licensed channels to exploit instantaneous spectrum availability, is a promising approach to achieve efficient spectrum utilization and mitigate spectrum scarcity. In order to reduce spectrum handoff overhead, this paper propose two heuristic spectrum allocation and reallocation methods based ...