scientific article; zbMATH DE number 2086635

zbMath1056.68587MaRDI QIDQ4737170

Ladislav Stacho, Ugo Vaccaro, Pavol Hell, Luisa Gargano

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2380/23800355.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (28)

Cutting-plane-based algorithms for two branch vertices related spanning tree problems ⋮ Spanning spiders and light-splitting switches ⋮ The spanning k-trees, perfect matchings and spectral radius of graphs ⋮ An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices ⋮ Degree sums and spanning brooms of a graph ⋮ Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem ⋮ A branch-and-cut algorithm for the minimum branch vertices spanning tree problem ⋮ Directed Steiner trees with diffusion costs ⋮ Degree Conditions for Spanning Brooms ⋮ Lower and upper bounds for the spanning tree with minimum branch vertices ⋮ Decomposition methods based on articulation vertices for degree-dependent spanning tree problems ⋮ Spanning trees with few branch vertices in graphs of bounded neighborhood diversity ⋮ A genetic approach for the 2‐edge‐connected minimum branch vertices problem ⋮ Bounded-degree spanning tree problems: models and new algorithms ⋮ An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth ⋮ An edge-swap heuristic for generating spanning trees with minimum number of branch vertices ⋮ A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem ⋮ Spanning trees: A survey ⋮ On ordinary and signless Laplacian spectral radius of graphs with fixed number of branch vertices ⋮ Relations, models and a memetic approach for three degree-dependent spanning tree problems ⋮ On spanning trees with few branch vertices ⋮ Spanning trees whose stems have a bounded number of branch vertices ⋮ The generalized minimum branch vertices problem: properties and polyhedral analysis ⋮ Spanning trees with a bounded number of branch vertices in a claw-free graph ⋮ Spanning Trees with Few Branch Vertices ⋮ Approximating the maximum internal spanning tree problem ⋮ Approximating spanning trees with few branches ⋮ Steiner Problems with Limited Number of Branching Nodes

This page was built for publication: