Partitioning planar graphs with vertex costs: Algorithms and applications (Q1578391): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q452000 |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s004530010031 / rank | |||
| Property / author | |||
| Property / author: Hristo N. Djidjev / rank | |||
Normal rank | |||
| 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/s004530010031 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2017376066 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S004530010031 / rank | |||
Normal rank | |||
Latest revision as of 21:50, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning planar graphs with vertex costs: Algorithms and applications |
scientific article |
Statements
Partitioning planar graphs with vertex costs: Algorithms and applications (English)
0 references
27 August 2000
0 references
graph embedding problems
0 references
graph pebbling
0 references
multicommodity flow problems
0 references
