3204 search results - page 295 / 641 » The b-chromatic Number of a Graph |
84
Voted
ICCAD
2006
IEEE
15 years 10 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...
102
click to vote
ICDM
2009
IEEE
15 years 7 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...
104
Voted
ICHIT
2009
Springer
15 years 7 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...
121
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
114
Voted
COCOA
2007
Springer
15 years 7 months ago
2007
Springer
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...