On parallel complexity of maximum f-matching and the degree sequence problem (Q5096889): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/3-540-58338-6_78 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1853868098 / rank | |||
Normal rank | |||
Revision as of 18:33, 19 March 2024
scientific article; zbMATH DE number 7573194
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On parallel complexity of maximum f-matching and the degree sequence problem |
scientific article; zbMATH DE number 7573194 |
Statements
On parallel complexity of maximum f-matching and the degree sequence problem (English)
0 references
18 August 2022
0 references
