Coarse grained parallel maximum matching in convex bipartite graphs

Proceedings of the International Parallel Processing Symposium, IPPS

Volumn , Issue , 1999, Pages 125-129

  Bose, P ^a   Chan, A ^a   Dehne, F ^a   Latzel, M ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATHEMATICAL MODELS; PARALLEL ALGORITHMS;

BULK SYNCHRONOUS PARALLEL (BSP) MODELS; COARSE GRAINED PARALLEL MAXIMUM MATCHING;

PARALLEL PROCESSING SYSTEMS;

EID: 0032683615     PISSN: 10637133     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Article

References (18)