The following pages link to (Q4737170):
Displaying 30 items.
- Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem (Q319657) (← links)
- Directed Steiner trees with diffusion costs (Q346492) (← links)
- Lower and upper bounds for the spanning tree with minimum branch vertices (Q377727) (← links)
- Bounded-degree spanning tree problems: models and new algorithms (Q632386) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Spanning trees whose stems have a bounded number of branch vertices (Q726654) (← links)
- Spanning trees with a bounded number of branch vertices in a claw-free graph (Q742583) (← links)
- Approximating the maximum internal spanning tree problem (Q1034535) (← links)
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem (Q1652257) (← links)
- Decomposition methods based on articulation vertices for degree-dependent spanning tree problems (Q1694405) (← links)
- A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem (Q1728477) (← links)
- On ordinary and signless Laplacian spectral radius of graphs with fixed number of branch vertices (Q1735433) (← links)
- Spanning spiders and light-splitting switches (Q1877652) (← links)
- The generalized minimum branch vertices problem: properties and polyhedral analysis (Q2031951) (← links)
- Degree sums and spanning brooms of a graph (Q2144512) (← links)
- Relations, models and a memetic approach for three degree-dependent spanning tree problems (Q2255965) (← links)
- On spanning trees with few branch vertices (Q2279263) (← links)
- Approximating spanning trees with few branches (Q2344216) (← links)
- Cutting-plane-based algorithms for two branch vertices related spanning tree problems (Q2357824) (← links)
- An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices (Q2374371) (← links)
- An edge-swap heuristic for generating spanning trees with minimum number of branch vertices (Q2448195) (← links)
- Conditions for spanning trees whose internal subtrees have few branch vertices and leaves (Q2693743) (← links)
- Steiner Problems with Limited Number of Branching Nodes (Q2868654) (← links)
- Degree Conditions for Spanning Brooms (Q2930040) (← links)
- Spanning Trees with Few Branch Vertices (Q5232165) (← links)
- (Q5244007) (← links)
- The spanning <i>k</i>-trees, perfect matchings and spectral radius of graphs (Q5888899) (← links)
- A genetic approach for the 2‐edge‐connected minimum branch vertices problem (Q6180021) (← links)
- An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth (Q6201339) (← links)
- Spanning trees with few branch vertices in \(K_{1,4}\)-free graphs (Q6542034) (← links)
