Flow Hypergraph Reducibility (Q3503561): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2008.01.044
+Normal rank
@@ Property / OpenAlex ID @@
+W1984271254
@@ Property / OpenAlex ID: W1984271254 / rank @@
+Normal rank
@@ Property / cites work @@
+Directed hypergraphs and applications
@@ Property / cites work: Directed hypergraphs and applications / rank @@
+Normal rank
@@ Property / cites work @@
+Flow Graph Reducibility
@@ Property / cites work: Flow Graph Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of Reducible Flow Graphs
@@ Property / cites work: Characterizations of Reducible Flow Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs
+Normal rank
@@ Property / cites work @@
+Q4062628
@@ Property / cites work: Q4062628 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving problems for maximal reducible flowgraphs.
+Normal rank
@@ Property / cites work @@
+The complexity of arc-colorings for directed hypergraphs
+Normal rank