Searching for "Legal coloring of graphs." – sorted by Relevance.
8 documents found, showing 1 through 8.
-
Comparison of Four Heuristic Algorithms for Unified Allocation and Binding in High-Level Synthesis
- … legal *) best_color := NewColor ( graph ) node.color := best_color best_cost := ColoringCost ( graph…
- Cited by 1 (1 self) – Add To MetaCart
-
Comparison of Four Heuristic Algorithms for Unified Allocation and Binding in High-Level Synthesis
- … then return graph end (* A new color is always legal *) best_color := NewColor ( graph ) node.color := best_color…
- Add To MetaCart
-
Self-stabilizing Algorithms for Graph Coloring
- … Algorithm 1 finds a legal coloring of an arbitrary graph and uses not more than two colors when applied…
- Add To MetaCart
-
Extending and Implementing the Stable Model Semantics
- … gives a legal coloring of the graph where a node v is colored with the color n i v(n) is included…
- Cited by 194 (4 self) – Add To MetaCart
-
The Dinitz Problem is solved for rectangles
- … the number of odd and even orientations of a graph and the existence of S-legal colorings of that graph…
- Cited by 1 (0 self) – Add To MetaCart
-
Extending the Smodels System with Cardinality and Weight Constraints
- … model of the program gives a legal coloring of the graph where a node v is colored with the color n i v…
- Cited by 50 (9 self) – Add To MetaCart
-
Project Final Report
- … graph is the minimal number of colors needed to legally color the graph. The clique number is the size…
- Add To MetaCart
-
Stable Model Semantics of Weight Constraint Rules
- … model of the program, which is a set of atoms of the form v(n), gives a legal coloring of the graph…
- Cited by 31 (8 self) – Add To MetaCart
Showing 1 through 8.
