Sciweavers

1749 search results - page 70 / 350
» Conditional colorings of graphs
Sort
View
IPL
2008
89views more  IPL 2008»
15 years 6 months ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik
ICCD
1995
IEEE
121views Hardware» more  ICCD 1995»
15 years 10 months ago
Analysis of conditional resource sharing using a guard-based control representation
Optimization of hardware resources for conditional data-flow graph behavior is particularly important when conditional behavior occurs in cyclic loops and maximization of through...
Ivan P. Radivojevic, Forrest Brewer
SIAMDM
2008
154views more  SIAMDM 2008»
15 years 6 months ago
On the First-Fit Chromatic Number of Graphs
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...
József Balogh, Stephen G. Hartke, Qi Liu, G...
MICCAI
2006
Springer
16 years 7 months ago
Cell Segmentation Using Coupled Level Sets and Graph-Vertex Coloring
Sumit Kumar Nath, Kannappan Palaniappan, Filiz Bun...