1538 search results - page 90 / 308 » Spectral Techniques in Graph Algorithms |
110
click to vote
ISAAC
1998
Springer
15 years 5 months ago
1998
Springer
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
132
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
106
click to vote
ICPADS
2005
IEEE
15 years 7 months ago
2005
IEEE
PageRank becomes the most well-known re-ranking technique of the search results. By its iterative computational nature, the computation takes much computing time and resource. Res...
166
click to vote
CORR
2004
Springer
15 years 1 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
100
click to vote
MIDDLEWARE
2004
Springer
15 years 6 months ago
2004
Springer
Simulation studies are frequently used to evaluate new peer-to-peer searching techniques as well as existing techniques on new applications. Unless these studies are accurate in th...