Characterizing acyclic graphs by labeling edges (Q2448884): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2013.06.019
+Normal rank
@@ Property / OpenAlex ID @@
+W2030612572
@@ Property / OpenAlex ID: W2030612572 / rank @@
+Normal rank
@@ Property / cites work @@
+A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
+Normal rank
@@ Property / cites work @@
+The probabilistic minimum spanning tree problem
@@ Property / cites work: The probabilistic minimum spanning tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Matroids and the greedy algorithm
@@ Property / cites work: Matroids and the greedy algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Community structure in social and biological networks
+Normal rank
@@ Property / cites work @@
+Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
+Normal rank
@@ Property / cites work @@
+Integer Programming Formulation of Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+The complexity of the capacitated tree problem
@@ Property / cites work: The complexity of the capacitated tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3184605
@@ Property / cites work: Q3184605 / rank @@
+Normal rank