2432 search results - page 82 / 487 » Degrees and choice numbers |
155
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...
159
click to vote
ICDCS
2002
IEEE
15 years 11 months ago
2002
IEEE
For many Internet applications, the ability to protect the identity of participants in a distributed applications is critical. For such applications, a number of anonymous communi...
155
click to vote
ICPP
1995
IEEE
15 years 9 months ago
1995
IEEE
Software barriers have been designed and evaluated for barrier synchronization in large-scale shared-memory multiprocessors, under the assumption that all processorsreach the sync...
168
click to vote
JCO
2007
15 years 6 months ago
2007
In a graph G, a vertex dominates itself and its neighbors. A subset S ⊆ V (G) is an m-tuple dominating set if S dominates every vertex of G at least m times, and an m-dominating...
127
click to vote
DM
2006
15 years 6 months ago
2006
For an integer r > 0, a conditional (k, r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex of degree at least r in G will be adjacent t...