On complexity of multidistance graph recognition in \(\mathbb{R}^1\) (Q1690053): Difference between revisions

@@ Property / DOI @@
-.1016/j.endm.2017.07.070
@@ Property / DOI: 10.1016/j.endm.2017.07.070 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W2744474468
@@ Property / OpenAlex ID: W2744474468 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.05140
@@ Property / arXiv ID: 1710.05140 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of minimizing wire lengths in VLSI layouts
+Normal rank
@@ Property / cites work @@
+Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
+Normal rank
@@ Property / cites work @@
+Unit disk graph recognition is NP-hard
@@ Property / cites work: Unit disk graph recognition is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q4423053
@@ Property / cites work: Q4423053 / rank @@
+Normal rank
@@ Property / cites work @@
+The logic engine and the realization problem for nearest neighbor graphs
+Normal rank
@@ Property / cites work @@
+On Sets of Distances of n Points
@@ Property / cites work: On Sets of Distances of n Points / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of H-coloring
@@ Property / cites work: On the complexity of H-coloring / rank @@
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Degenerate Unit Distance Representations of Graphs
+Normal rank
@@ Property / cites work @@
+Sphere and dot product representations of graphs
@@ Property / cites work: Sphere and dot product representations of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph homomorphisms with infinite targets
@@ Property / cites work: Graph homomorphisms with infinite targets / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of finding iso- and other morphisms for partial \(k\)- trees
+Normal rank
@@ Property / cites work @@
+Coloring Distance Graphs and Graphs of Diameters
@@ Property / cites work: Coloring Distance Graphs and Graphs of Diameters / rank @@
+Normal rank
@@ Property / cites work @@
+Borsuk's problem and the chromatic numbers of some metric spaces
+Normal rank
@@ Property / cites work @@
+Q3544791
@@ Property / cites work: Q3544791 / rank @@
+Normal rank
@@ Property / cites work @@
+Realizability of Graphs and Linkages
@@ Property / cites work: Realizability of Graphs and Linkages / rank @@
+Normal rank
@@ Property / cites work @@
+Turán type results for distance graphs
@@ Property / cites work: Turán type results for distance graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On computational complexity of length embeddability of graphs
+Normal rank
@@ Property / DOI @@
+.1016/J.ENDM.2017.07.070
@@ Property / DOI: 10.1016/J.ENDM.2017.07.070 / rank @@
+Normal rank