483 search results - page 64 / 97 » On perfectness of sums of graphs |
APPROX
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
DM
2008
14 years 10 months ago
2008
A nonincreasing sequence of nonnegative integers = (d1, d2, ..., dn) is graphic if there is a (simple) graph G of order n having degree sequence . In this case, G is said to reali...
ISAAC
2005
Springer
15 years 4 months ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
SIGECOM
2008
ACM
14 years 10 months ago
2008
ACM
For the problem of allocating one or more items among a group of competing agents, the Vickrey-Clarke-Groves (VCG) mechanism is strategy-proof and efficient. However, the VCG mech...
107
click to vote
WADS
1993
Springer
15 years 2 months ago
1993
Springer
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...