Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP (Q4344457)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP |
scientific article; zbMATH DE number 1034104
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP |
scientific article; zbMATH DE number 1034104 |
Statements
30 October 1997
0 references
undirected graph
0 references
magic labeling
0 references
parallel maximum flow algorithms
0 references
Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP (English)
0 references
