A polynomial time solution for labeling a rectilinear map (Q293240): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+U05
@@ Property / Mathematics Subject Classification ID: 68U05 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6590690
@@ Property / zbMATH DE Number: 6590690 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+computational geometry
@@ Property / zbMATH Keywords: computational geometry / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+map labeling
@@ Property / zbMATH Keywords: map labeling / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q55918916
@@ Property / Wikidata QID: Q55918916 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501791
@@ Property / cites work: Q5501791 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Timetable and Multicommodity Flow Problems
+Normal rank
@@ Property / cites work @@
+The Problem of Compatible Representatives
@@ Property / cites work: The Problem of Compatible Representatives / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate map labeling is in \(\Omega (n\log n)\)
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:293240