Pages that link to "Item:Q3311677"
From MaRDI portal
The following pages link to Steiner trees, partial 2–trees, and minimum IFI networks (Q3311677):
Displayed 50 items.
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- Efficient sets in partial \(k\)-trees (Q686252) (← links)
- On the SPANNING \(k\)-TREE problem (Q686254) (← links)
- Computing residual connectedness reliability for restricted networks (Q686266) (← links)
- Finding maximum cliques in arbitrary and in special graphs (Q807639) (← links)
- Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs (Q864162) (← links)
- A factoring approach for the Steiner tree problem in undirected networks (Q881873) (← links)
- Forbidden minors characterization of partial 3-trees (Q913807) (← links)
- On two dual classes of planar graphs (Q916681) (← links)
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey (Q1062758) (← links)
- Generalized Steiner problem in outerplanar networks (Q1074505) (← links)
- Characterization of partial 3-trees in terms of three structures (Q1086577) (← links)
- Steiner problem in Halin networks (Q1092013) (← links)
- Minimum-maximal matching in series-parallel graphs (Q1099085) (← links)
- A parallelizable lexicographically first maximal edge-induced subgraph problem (Q1108808) (← links)
- Structural conditions for cycle completable graphs (Q1126192) (← links)
- Permutation graphs: Connected domination and Steiner trees (Q1174135) (← links)
- Algorithms for recognition of regular properties and decomposition of recursive graph families (Q1179734) (← links)
- The role of Steiner hulls in the solution to Steiner tree problems (Q1179758) (← links)
- Temporal constraint networks (Q1182161) (← links)
- Problems with generalized Steiner problems (Q1186806) (← links)
- Canonical representations of partial 2- and 3-trees (Q1196453) (← links)
- The most vital edges with respect to the number of spanning trees in two- terminal series-parallel graphs (Q1198968) (← links)
- Minimum perfect bipartite matchings and spanning trees under categorization (Q1201102) (← links)
- An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree (Q1205700) (← links)
- Weighted connected domination and Steiner trees in distance-hereditary graphs (Q1270785) (← links)
- A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges (Q1274933) (← links)
- On some optimization problems on \(k\)-trees and partial \(k\)-trees (Q1315461) (← links)
- The Steiner tree polytope and related polyhedra (Q1322552) (← links)
- Tree polytope on 2-trees (Q1322553) (← links)
- Arborescence polytopes for series-parallel graphs (Q1329787) (← links)
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets (Q1330902) (← links)
- The Steiner tree problem. II: Properties and classes of facets (Q1330903) (← links)
- Cuts, matrix completions and graph rigidity (Q1365058) (← links)
- A PTAS for weight constrained Steiner trees in series--parallel graphs. (Q1401399) (← links)
- The complexity of the locally connected spanning tree problem (Q1408813) (← links)
- On the extension of a partial metric to a tree metric (Q1422428) (← links)
- Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
- Steiner's problem in double trees (Q1861809) (← links)
- A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints (Q1887939) (← links)
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← 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)
- Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results (Q4845143) (← links)
- Steiner trees and polyhedra (Q5946818) (← links)
- Using a hybrid of exact and genetic algorithms to design survivable networks (Q5955471) (← links)