172 search results - page 17 / 35 » The Analysis of a List-Coloring Algorithm on a Random Graph |
129
Voted
CIKM
2010
Springer
15 years 19 days ago
2010
Springer
We describe efficient techniques for construction of large term co-occurrence graphs, and investigate an application to the discovery of numerous fine-grained (specific) topics. A...
124
Voted
STOC
2006
ACM
15 years 8 months ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
113
click to vote
ASPDAC
2010
ACM
15 years 20 days ago
2010
ACM
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
128
Voted
CIAC
2006
Springer
15 years 6 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
140
Voted
STOC
2007
ACM
16 years 2 months ago
2007
ACM
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...