The following pages link to On the SPANNING \(k\)-TREE problem (Q686254):
Displaying 26 items.
- Heuristics for the network design problem with connectivity requirements (Q281782) (← links)
- The three-in-a-tree problem (Q653792) (← links)
- On the complexity of some subgraph problems (Q967414) (← links)
- On the \(K\) shortest path trees problem (Q1040982) (← links)
- On finding most uniform spanning trees (Q1102979) (← links)
- On the spanning tree polyhedron (Q1122482) (← links)
- NP-completeness and degree restricted spanning trees (Q1199472) (← links)
- The 2-hop spanning tree problem (Q1306467) (← links)
- On spanning 2-trees in a graph (Q1356500) (← links)
- Spanning star trees in regular graphs (Q1376073) (← links)
- The complexity of the locally connected spanning tree problem (Q1408813) (← links)
- Optimal decomposition and recombination of isostatic geometric constraint systems for designing layered materials (Q1632383) (← links)
- Complexity of some graph-based bounds on the probability of a union of events (Q1752603) (← links)
- The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy (Q2181262) (← links)
- On a spanning \(k\)-tree in which specified vertices have degree less than \(k\) (Q2259579) (← links)
- On a spanning \(K\)-tree containing specified vertices in a graph (Q2300534) (← links)
- Maximum series-parallel subgraph (Q2429333) (← links)
- (Q3323972) (← links)
- The (K,k)-Capacitated Spanning Tree Problem (Q3578356) (← links)
- On the Red/Blue Spanning Tree Problem (Q3630196) (← links)
- (Q4258252) (← links)
- (Q4851642) (← links)
- Plane Triangulations Without Spanning 2-Trees (Q5060442) (← links)
- (Q5075270) (← links)
- The spanning trees forced by the path and the star (Q5284589) (← links)
- A \((1/2+1/60)\)-approximation algorithm for maximum weight series-parallel subgraph (Q6558687) (← links)
