49 search results - page 1 / 10 » Self-Stabilizing Distributed Algorithm for Strong Matching i... |
HIPC
2003
Springer
14 years 4 months ago
2003
Springer
PPL
2008
13 years 10 months ago
2008
We provide self-stabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linea...
SOFSEM
1997
Springer
14 years 3 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
CORR
2012
Springer
12 years 6 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
ISAAC
1998
Springer
14 years 3 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...