718 search results - page 94 / 144 » Coloring quasi-line graphs |
124
click to vote
DM
2011
14 years 6 months ago
2011
Let G be the set of finite graphs whose vertices belong to some fixed countable set, and let ≡ be an equivalence relation on G. By the strengthening of ≡ we mean an equivalen...
117
click to vote
GRAPHICSINTERFACE
2011
14 years 3 months ago
2011
People generally remember locations in visual spaces with respect to spatial features and landmarks. Geographical maps provide many spatial features and hence are easy to remember...
WWW
2009
ACM
16 years 17 days ago
2009
ACM
We introduce a multi-label classification model and algorithm for labeling heterogeneous networks, where nodes belong to different types and different types have different sets of...
104
click to vote
COCOON
1999
Springer
15 years 4 months ago
1999
Springer
Scheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It occurs in two versions: in the preemptive case, each vertex may get any set of colors, w...
ISCAPDCS
2004
15 years 1 months ago
2004
This paper addresses the application of distributed constraint optimization problems (DCOPs) to large-scale dynamic environments. We introduce a decomposition of DCOP into a graph...