Sciweavers

49 search results - page 1 / 10
» Self-Stabilizing Distributed Algorithm for Strong Matching i...
Sort
View
HIPC
2003
Springer
13 years 8 months ago
Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph
Wayne Goddard, Stephen T. Hedetniemi, David Pokras...
PPL
2008
94views more  PPL 2008»
13 years 3 months ago
Self-Stabilizing Graph Protocols
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...
Wayne Goddard, Stephen T. Hedetniemi, David Pokras...
SOFSEM
1997
Springer
13 years 7 months ago
Time Optimal Self-Stabilizing Algorithms
: 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...
Rastislav Kralovic
CORR
2012
Springer
176views Education» more  CORR 2012»
11 years 11 months ago
Capturing Topology in Graph Pattern Matching
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...
Shuai Ma, Yang Cao, Wenfei Fan, Jinpeng Huai, Tian...
ISAAC
1998
Springer
66views Algorithms» more  ISAAC 1998»
13 years 7 months ago
A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution
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...
Josep Díaz, Jordi Petit, Panagiotis Psychar...