The following pages link to On the SPANNING \(k\)-TREE problem (Q686254):
Displaying 10 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 spanning 2-trees in a graph (Q1356500) (← 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)
- Maximum series-parallel subgraph (Q2429333) (← links)
- Plane Triangulations Without Spanning 2-Trees (Q5060442) (← links)
- A \((1/2+1/60)\)-approximation algorithm for maximum weight series-parallel subgraph (Q6558687) (← links)
