1857 search results - page 216 / 372 » Minimum Degree Orderings |
131
click to vote
COMBINATORICS
1999
15 years 6 months ago
1999
An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property that if two vertices are colored with the same color in c1, then they must hav...
189
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
We present a set of five axioms for fairness measures in resource allocation. A family of fairness measures satisfying the axioms is constructed. Well-known notions such as -fairne...
243
click to vote
MST
2010
15 years 1 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
192
click to vote
GD
2004
Springer
15 years 12 months ago
2004
Springer
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
196
click to vote
ATAL
2006
Springer
15 years 8 months ago
2006
Springer
In this paper we present the internal architecture and bidding mechanisms designed for Mertacor, a successful trading agent, which ended up first in the Classic Trading Agent Comp...