Approximating Transitive Reductions for Directed Networks (Q3183442): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-03367-4_7
+Normal rank
@@ Property / OpenAlex ID @@
+W1600160609
@@ Property / OpenAlex ID: W1600160609 / rank @@
+Normal rank
@@ Property / cites work @@
+The Transitive Reduction of a Directed Graph
@@ Property / cites work: The Transitive Reduction of a Directed Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Inferring (biological) signal transduction networks via transitive reductions of directed graphs
+Normal rank
@@ Property / cites work @@
+Q5595648
@@ Property / cites work: Q5595648 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Several Graph Augmentation Problems
+Normal rank
@@ Property / cites work @@
+A simple derivation of edmonds' algorithm for optimum branchings
+Normal rank
@@ Property / cites work @@
+Approximating the Minimum Equivalent Digraph
@@ Property / cites work: Approximating the Minimum Equivalent Digraph / rank @@
+Normal rank
@@ Property / cites work @@
+On strongly connected digraphs with bounded cycle length
+Normal rank
@@ Property / cites work @@
+Q4252419
@@ Property / cites work: Q4252419 / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for Finding a Minimum Equivalent Graph of a Digraph
+Normal rank
@@ Property / cites work @@
+Q2768327
@@ Property / cites work: Q2768327 / rank @@
+Normal rank