A polynomial time solution for labeling a rectilinear map (Q293240): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q55918916, #quickstatements; #temporary_batch_1711234560214 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5501791 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Problem of Compatible Representatives / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3992847 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximate map labeling is in \(\Omega (n\log n)\) / rank | |||
Normal rank | |||
Latest revision as of 02:37, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time solution for labeling a rectilinear map |
scientific article |
Statements
A polynomial time solution for labeling a rectilinear map (English)
0 references
9 June 2016
0 references
computational geometry
0 references
map labeling
0 references
