On crossing families of complete geometric graphs (Q2416466): Difference between revisions

← Older edit

@@ Property / DOI @@
-.1007/s10474-018-0880-1
@@ Property / DOI: 10.1007/s10474-018-0880-1 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3103130867
@@ Property / OpenAlex ID: W3103130867 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.09888
@@ Property / arXiv ID: 1805.09888 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q129057157
@@ Property / Wikidata QID: Q129057157 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10474-018-0880-1
@@ Property / DOI: 10.1007/S10474-018-0880-1 / rank @@
+Normal rank
@@ Property / Recommended article @@
+Q2857373
@@ Property / Recommended article: Q2857373 / rank @@
+Normal rank
@@ Property / Recommended article: Q2857373 / qualifier @@
+Similarity Score: 0.95041627Amount 0.95041627
Unit 1
-Amount
+.95041627
 Unit
@@ Property / Recommended article: Q2857373 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+On Disjoint Crossing Families in Geometric Graphs
+Normal rank
+Similarity Score: 0.95041627Amount 0.95041627
Unit 1
-Amount
+.95041627
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Bounds on the crossing resolution of complete geometric graphs
+Normal rank
+Similarity Score: 0.9162202Amount 0.9162202
Unit 1
-Amount
+.9162202
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+On the crossing number of complete graphs
+Normal rank
+Similarity Score: 0.9141607Amount 0.9141607
Unit 1
-Amount
+.9141607
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+On the crossing number of complete graphs
+Normal rank
+Similarity Score: 0.9141607Amount 0.9141607
Unit 1
-Amount
+.9141607
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+On crossing numbers of geometric proximity graphs
+Normal rank
+Similarity Score: 0.9138144Amount 0.9138144
Unit 1
-Amount
+.9138144
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q4471347
@@ Property / Recommended article: Q4471347 / rank @@
+Normal rank
@@ Property / Recommended article: Q4471347 / qualifier @@
+Similarity Score: 0.9059857Amount 0.9059857
Unit 1
-Amount
+.9059857
 Unit
@@ Property / Recommended article: Q4471347 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q5370649
@@ Property / Recommended article: Q5370649 / rank @@
+Normal rank
@@ Property / Recommended article: Q5370649 / qualifier @@
+Similarity Score: 0.8984004Amount 0.8984004
Unit 1
-Amount
+.8984004
 Unit
@@ Property / Recommended article: Q5370649 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+On the crossing number of some complete multipartite graphs
+Normal rank
+Similarity Score: 0.89763165Amount 0.89763165
Unit 1
-Amount
+.89763165
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Counting and enumerating crossing-free geometric graphs
+Normal rank
+Similarity Score: 0.8969666Amount 0.8969666
Unit 1
-Amount
+.8969666
 Unit
+Recommender Run: Recommender Run 2