scientific article; zbMATH DE number 2086635
From MaRDI portal
Publication:4737170
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)
Recommendations
- Bounded-degree spanning tree problems: models and new algorithms
- Spanning Trees with Few Branch Vertices
- A generalization of the minimum branch vertices spanning tree problem
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
- Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem
Cited in
(37)- Approximating the maximum internal spanning tree problem
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
- A generalization of the minimum branch vertices spanning tree problem
- Decomposition methods based on articulation vertices for degree-dependent spanning tree problems
- A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem
- On ordinary and signless Laplacian spectral radius of graphs with fixed number of branch vertices
- Spanning spiders and light-splitting switches
- The generalized minimum branch vertices problem: properties and polyhedral analysis
- Degree sums and spanning brooms of a graph
- Relations, models and a memetic approach for three degree-dependent spanning tree problems
- On spanning trees with few branch vertices
- Approximating spanning trees with few branches
- Cutting-plane-based algorithms for two branch vertices related spanning tree problems
- An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices
- An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
- Conditions for spanning trees whose internal subtrees have few branch vertices and leaves
- Approximating spanning trees with few branches
- Steiner problems with limited number of branching nodes
- Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem
- Directed Steiner trees with diffusion costs
- Lower and upper bounds for the spanning tree with minimum branch vertices
- Spanning Trees with Few Branch Vertices
- scientific article; zbMATH DE number 7132826 (Why is no real title available?)
- The spanning k-trees, perfect matchings and spectral radius of graphs
- Spanning trees with few branch vertices in graphs of bounded neighborhood diversity
- A genetic approach for the 2‐edge‐connected minimum branch vertices problem
- An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth
- Bounded-degree spanning tree problems: models and new algorithms
- Degree conditions for spanning brooms
- Spanning trees with few branch vertices in \(K_{1,4}\)-free graphs
- The minimum centroid branch spanning tree problem
- Spanning trees: A survey
- Ore-type conditions for existence of a jellyfish in a graph
- Spanning trees minimizing branching costs
- Spanning trees whose stems have a bounded number of branch vertices
- Title not available (Why is no real title available?)
- Spanning trees with a bounded number of branch vertices in a claw-free graph
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737170)
