On the distributed complexity of computing maximal matchings

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1998, Pages 219-225

  Hanckowiak, Michal ^a   Karonski, Michal ^a   Panconesi, Alessandro ^a  

^a ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; CONSTRAINT THEORY; DATA STORAGE EQUIPMENT; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; THEOREM PROVING;

DISTRIBUTED GRAPH ALGORITHMS; MAXIMAL INDEPENDENT SETS (MIS); MAXIMAL MATCHINGS (MM);

ALGORITHMS;

EID: 0032279794     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)