Non-crossing Paths with Geographic Constraints (Q4625135): Difference between revisions

← Older edit

@@ description / en / description / en @@
+scientific article; zbMATH DE number 7088256
@@ Property / zbMATH Open document ID @@
+.05141
@@ Property / zbMATH Open document ID: 1417.05141 / rank @@
+Normal rank
@@ Property / publication date @@
+August 2019Timestamp +2019-08-01T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2019-08-01T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 1 August 2019 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://dmtcs.episciences.org/5495/pdf
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C82
@@ Property / Mathematics Subject Classification ID: 05C82 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+7088256
@@ Property / zbMATH DE Number: 7088256 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+non-crossing connectors problem
@@ Property / zbMATH Keywords: non-crossing connectors problem / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+constrained graph drawing
@@ Property / zbMATH Keywords: constrained graph drawing / rank @@
+Normal rank