Generating cut conjunctions in graphs and related problems (Q930604): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-007-9111-9
@@ Property / DOI: 10.1007/s00453-007-9111-9 / rank @@
-Normal rank
@@ Property / author @@
+Leonid G. Khachiyan
@@ Property / author: Leonid G. Khachiyan / rank @@
+Normal rank
@@ Property / author @@
+Khaled M. Elbassioni
@@ Property / author: Khaled M. Elbassioni / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q59560592
@@ Property / Wikidata QID: Q59560592 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-007-9111-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2103746934
@@ Property / OpenAlex ID: W2103746934 / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2004
@@ Property / cites work: Mathematical Foundations of Computer Science 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Some Enumeration Problems for Matroids
+Normal rank
@@ Property / cites work @@
+Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
+Normal rank
@@ Property / cites work @@
+The Complexity of Multiterminal Cuts
@@ Property / cites work: The Complexity of Multiterminal Cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Identifying the Minimal Transversals of a Hypergraph and Related Problems
+Normal rank
@@ Property / cites work @@
+On the Complexity of Dualization of Monotone Disjunctive Normal Forms
+Normal rank
@@ Property / cites work @@
+Multi-Commodity Network Flows
@@ Property / cites work: Multi-Commodity Network Flows / rank @@
+Normal rank
@@ Property / cites work @@
+On generating all maximal independent sets
@@ Property / cites work: On generating all maximal independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
+Normal rank
@@ Property / cites work @@
+Q3135082
@@ Property / cites work: Q3135082 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+On enumerating all minimal solutions of feedback problems
+Normal rank
@@ Property / cites work @@
+EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH
+Normal rank
@@ Property / cites work @@
+A note on finding the bridges of a graph
@@ Property / cites work: A note on finding the bridges of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
+Normal rank
@@ Property / cites work @@
+Q4782696
@@ Property / cites work: Q4782696 / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/algorithmica/KhachiyanBBEGM08
@@ Property / DBLP publication ID: journals/algorithmica/KhachiyanBBEGM08 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00453-007-9111-9
@@ Property / DOI: 10.1007/S00453-007-9111-9 / rank @@
+Normal rank