5606 search results - page 817 / 1122 » Randomization Techniques for Graphs. |
149
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In this paper we rigorously prove the validity of the cavity method for the problem of counting the number of matchings in graphs with large girth. Cavity method is an important he...
184
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomi...
190
click to vote
IANDC
2007
15 years 6 months ago
2007
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...
184
click to vote
IJNSEC
2007
15 years 6 months ago
2007
In this work, we show that the current termination condition of the Probabilistic Packet Marking (PPM) algorithm is not correct for general networks, and this implies the estimati...
177
click to vote
AC
2004
Springer
15 years 6 months ago
2004
Springer
Shotgun sequencing is the most widely used technique for determining the DNA sequence of organisms. It involves breaking up the DNA into many small pieces that can be read by auto...