An algorithmic framework for labeling network maps (Q1750356): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4474130 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Improved Algorithm for the Metro-line Crossing Minimization Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Edge routing with ordered bundles / rank | |||
Normal rank | |||
Latest revision as of 15:34, 15 July 2024
scientific article; zbMATH DE number 6501955
- An Algorithmic Framework for Labeling Network Maps
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithmic framework for labeling network maps |
scientific article; zbMATH DE number 6501955 |
|
Statements
An algorithmic framework for labeling network maps (English)
0 references
An Algorithmic Framework for Labeling Network Maps (English)
0 references
18 May 2018
0 references
29 October 2015
0 references
labeling
0 references
metro maps
0 references
computational cartography
0 references
dynamic programming
0 references
integer linear programming
0 references
experimental evaluation
0 references
