New characterisations of tree-based networks and proximity measures (Q2411310): Difference between revisions

@@ Property / DOI @@
-.1016/j.aam.2017.08.003
@@ Property / DOI: 10.1016/j.aam.2017.08.003 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W2963197845
@@ Property / OpenAlex ID: W2963197845 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.04225
@@ Property / arXiv ID: 1611.04225 / rank @@
+Normal rank
@@ Property / cites work @@
+On determining if tree-based networks contain fixed trees
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+A decomposition theorem for partially ordered sets
+Normal rank
@@ Property / cites work @@
+On the existence of infinitely many universal tree-based networks
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Phylogenetic networks with every embedded phylogenetic tree a base tree
+Normal rank
@@ Property / DOI @@
+.1016/J.AAM.2017.08.003
@@ Property / DOI: 10.1016/J.AAM.2017.08.003 / rank @@
+Normal rank