335 search results - page 11 / 67 » Resolvent of large random graphs |
181
click to vote
PVLDB
2010
15 years 4 months ago
2010
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...
165
click to vote
INFOCOM
2006
IEEE
15 years 11 months ago
2006
IEEE
— Peer-to-peer systems are becoming increasingly popular, with millions of simultaneous users and a wide range of applications. Understanding existing systems and devising new pe...
145
click to vote
STACS
2004
Springer
15 years 11 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
173
click to vote
MFCS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
139
click to vote
DAC
2000
ACM
16 years 6 months ago
2000
ACM
Recently, intellectual property protection (IPP) techniques attracted a great deal of attention from semiconductor, system integration and software companies. A number of watermar...