NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs (Q4994988)
From MaRDI portal
scientific article; zbMATH DE number 7362094
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs |
scientific article; zbMATH DE number 7362094 |
Statements
NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs (English)
0 references
22 June 2021
0 references
parallel algorithms
0 references
perfect matching
0 references
graph minors
0 references
mimicking networks
0 references
maximum flow
0 references
0 references
0 references
0 references
0 references
0 references
0 references
