On shortest disjoint paths in planar graphs (Q429668): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68R10 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6048242 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
disjoint paths | |||
| Property / zbMATH Keywords: disjoint paths / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
shortest path | |||
| Property / zbMATH Keywords: shortest path / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
planar graph | |||
| Property / zbMATH Keywords: planar graph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
objective function | |||
| Property / zbMATH Keywords: objective function / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
minimum cost flow | |||
| Property / zbMATH Keywords: minimum cost flow / rank | |||
Normal rank | |||
Revision as of 23:35, 29 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On shortest disjoint paths in planar graphs |
scientific article |
Statements
On shortest disjoint paths in planar graphs (English)
0 references
20 June 2012
0 references
disjoint paths
0 references
shortest path
0 references
planar graph
0 references
objective function
0 references
minimum cost flow
0 references
