A New Combinatorial Approach for Sparse Graph Problems (Q3521912): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-70575-8_10 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1559994276 / rank | |||
Normal rank | |||
Latest revision as of 23:19, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A New Combinatorial Approach for Sparse Graph Problems |
scientific article |
Statements
A New Combinatorial Approach for Sparse Graph Problems (English)
0 references
28 August 2008
0 references
