3211 search results - page 331 / 643 » On the Grundy Number of a Graph |
172
click to vote
IPPS
2005
IEEE
16 years 10 days ago
2005
IEEE
The problem of radio channel assignments with multiple levels of interference can be modeled using graph theory. Given a graph G, possibly infinite, and real numbers k1, k2, . . ...
174
click to vote
DCG
2002
15 years 6 months ago
2002
For each pair (Qi, Qj) of reference points and each real number r there is a unique hyperplane h QiQj such that d(P, Qi)2 - d(P, Qj)2 = r for points P in h. Take n reference point...
156
Voted
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
170
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
—We describe an efficient algorithm for releasing a provably private estimate of the degree distribution of a network. The algorithm satisfies a rigorous property of differenti...
157
click to vote
ICHIT
2009
Springer
16 years 1 months ago
2009
Springer
Discovering the AS paths between two ASes are invaluable for a wide area of network research and application activities. The traditional techniques for path discovery require dire...