Edge ranking and searching in partial orders (Q955315): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2008.03.007
+Normal rank
@@ Property / OpenAlex ID @@
+W2064883689
@@ Property / OpenAlex ID: W2064883689 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Search in Trees
@@ Property / cites work: Optimal Search in Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q5472917
@@ Property / cites work: Q5472917 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge ranking of weighted trees
@@ Property / cites work: Edge ranking of weighted trees / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal node ranking of trees
@@ Property / cites work: Optimal node ranking of trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for finding low-degree subgraphs
+Normal rank
@@ Property / cites work @@
+Edge ranking of graphs is hard
@@ Property / cites work: Edge ranking of graphs is hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q4250211
@@ Property / cites work: Q4250211 / rank @@
+Normal rank
@@ Property / cites work @@
+Searching ordered structures
@@ Property / cites work: Searching ordered structures / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum average cost testing for partially ordered components
+Normal rank
@@ Property / cites work @@
+On Minimum Edge Ranking Spanning Trees
@@ Property / cites work: On Minimum Edge Ranking Spanning Trees / rank @@
+Normal rank