1208 search results - page 75 / 242 » On Counting Generalized Colorings |
DBPL
2007
Springer
14 years 3 months ago
2007
Springer
Annotated relational databases can be queried either by simply making the annotations explicitly available along the ordinary data, or by adapting the standard query operators so ...
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
Given an undirected graph with positive edge weights, define Nq(v) for each node v to be the set of q nodes closest to v (including v itself and breaking ties by node ID). It is ...
GC
2007
Springer
13 years 9 months ago
2007
Springer
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
WDAG
2007
Springer
14 years 3 months ago
2007
Springer
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
IHIS
2005
ACM
14 years 2 months ago
2005
ACM
Current Web services composition proposals, such as BPML, BPEL, WSCI, and OWL-S, provide notations for describing the control and data flows in Web service collaborations. However...