NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs (Q4994988): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3166103872 / rank | |||
Normal rank | |||
Latest revision as of 11:09, 30 July 2024
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
