Pages that link to "Item:Q3311677"
From MaRDI portal
The following pages link to Steiner trees, partial 2–trees, and minimum IFI networks (Q3311677):
Displaying 33 items.
- Computing directed Steiner path covers (Q2125222) (← links)
- Concepts of signed graph coloring (Q2225432) (← links)
- Stronger MIP formulations for the Steiner forest problem (Q2227541) (← links)
- A note on integral generalized flows in directed partial 2-trees (Q2234778) (← links)
- Assortment optimization under the multinomial logit model with product synergies (Q2294378) (← links)
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions (Q2343089) (← links)
- Characterizing graphs of maximum matching width at most 2 (Q2413972) (← links)
- Homomorphism bounds of signed bipartite \(K_4\)-minor-free graphs and edge-colorings of \(2k\)-regular \(K_4\)-minor-free multigraphs (Q2414452) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- Complexity of Steiner Tree in Split Graphs - Dichotomy Results (Q2795958) (← links)
- Bounds on vertex colorings with restrictions on the union of color classes (Q3083409) (← links)
- MULTI-TERMINAL NETWORK CONNECTEDNESS ON SERIES-PARALLEL NETWORKS (Q3397515) (← links)
- The graphs for which the maximum multiplicity of an eigenvalue is two (Q3399125) (← links)
- The traveling salesman problem on a graph and some related integer polyhedra (Q3675933) (← links)
- Characterization and Recognition of Partial 3-Trees (Q3728922) (← links)
- Complexity of Finding Embeddings in a <i>k</i>-Tree (Q3751595) (← links)
- Network Resilience (Q3801061) (← links)
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues (Q4012672) (← links)
- Constructive linear time algorithms for branchwidth (Q4571992) (← links)
- A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths (Q4645295) (← links)
- Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results (Q4845143) (← links)
- Cycle stochastic graphs: Structural and forbidden graph characterizations (Q4956232) (← links)
- Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree (Q5012805) (← links)
- Canonical representations of partial 2-and 3-trees (Q5056113) (← links)
- Finding a Small Number of Colourful Components (Q5088911) (← links)
- A simple linear time algorithm for triangulating three-colored graphs (Q5096799) (← links)
- Minimum size tree-decompositions (Q5890931) (← links)
- Minimum size tree-decompositions (Q5916057) (← links)
- Steiner trees and polyhedra (Q5946818) (← links)
- Using a hybrid of exact and genetic algorithms to design survivable networks (Q5955471) (← links)
- Toughness and spanning trees in K4‐minor‐free graphs (Q6055399) (← links)
- A stronger lower bound on parametric minimum spanning trees (Q6103526) (← links)
- On convexity in split graphs: complexity of Steiner tree and domination (Q6123388) (← links)
