NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs (Q4994988): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1802.00084 / rank | |||
Normal rank | |||
Revision as of 21:28, 19 April 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
