An efficient parallel algorithm for maximum matching for some classes of graphs (Q1268785)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient parallel algorithm for maximum matching for some classes of graphs |
scientific article; zbMATH DE number 1216778
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient parallel algorithm for maximum matching for some classes of graphs |
scientific article; zbMATH DE number 1216778 |
Statements
An efficient parallel algorithm for maximum matching for some classes of graphs (English)
0 references
1998
0 references
modular decomposition
0 references
matching parallel algorithm
0 references
