de Werra et al., 1994 - Google Patents
Chromatic scheduling and frequency assignmentde Werra et al., 1994
View PDF- Document ID
- 5529802241505823005
- Author
- de Werra D
- Gay Y
- Publication year
- Publication venue
- Discrete Applied Mathematics
External Links
Snippet
Some extensions of classical coloring models are developed; these consist in assigning to each node a set of consecutive colors; furthermore for each oriented arc (i, j) in a graph a set T ij of consecutive integers is given. It is required to find an assignment of colors to the nodes …
- 239000003086 colorant 0 abstract description 45
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| de Werra et al. | Chromatic scheduling and frequency assignment | |
| Panconesi et al. | On the complexity of distributed network decomposition | |
| Meyer | Minimum spanning forests for morphological segmentation | |
| Bazgan et al. | On the vertex-distinguishing proper edge-colorings of graphs | |
| Dechter | From local to global consistency | |
| Rao et al. | The rectilinear Steiner arborescence problem | |
| Vishwanathan | Randomized online graph coloring | |
| Häggström et al. | Percolation on transitive graphs as a coalescent process: relentless merging followed by simultaneous uniqueness | |
| Liberatore | On the complexity of choosing the branching literal in DPLL | |
| Awerbuch et al. | Near-linear cost sequential and distributed constructions of sparse neighborhood covers | |
| Deo et al. | Computing a diameter-constrained minimum spanning tree in parallel | |
| Bar-Noy et al. | Sum multicoloring of graphs | |
| Lalley et al. | Contact processes on random regular graphs | |
| Hansen et al. | Distributed largest-first algorithm for graph coloring | |
| De Simone et al. | Fair dissections of spiders, worms, and caterpillars | |
| Grötschel et al. | A polynomial algorithm for the max-cut problem on graphs without long odd cycles | |
| Gent et al. | Decomposable constraints | |
| Wan et al. | A simple heuristic for minimum connected dominating set in graphs | |
| Fujishige | Canonical decompositions of symmetric submodular systems | |
| Göbel et al. | Label-connected graphs and the gossip problem | |
| Lucena | A new lower bound for tree-width using maximum cardinality search | |
| Bodlaender et al. | It is hard to know when greedy is good for finding independent sets | |
| Harutyunyan et al. | Broadcasting in chains of rings | |
| Chalopin et al. | Election, naming and cellular edge local computations | |
| Hertz et al. | On the stability number of AH‐free graphs |