The rainbow spanning forest problem

DOI10.1007/s00500-017-2540-8zbMath1398.90132OpenAlexW2595243011MaRDI QIDQ1797922

Raffaele Cerulli, Carmine Cerrone, Selene Silvestri, Francesco Carrabs

Publication date: 22 October 2018

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-017-2540-8

zbMATH Keywords

graph theoryedge-colored graphrainbow componentsheterochromatic componentsmulti-start scheme

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (6)

Exact approaches for the orderly colored longest path problem: performance comparison ⋮ Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles ⋮ The rainbow Steiner tree problem ⋮ Two heuristics for the rainbow spanning forest problem ⋮ Maximum weighted induced forests and trees: new formulations and a computational comparative review ⋮ An exact reduction technique for the k-colour shortest path problem

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Edge-disjoint rainbow spanning trees in complete graphs
• Vehicle-ID sensor location for route flow recognition: models and algorithms
• A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants
• Discrete particle swarm optimization for the minimum labelling Steiner tree problem
• The labeled maximum matching problem
• The minimum labeling spanning trees
• On the minimum label spanning tree problem
• Carousel greedy: a generalized greedy algorithm with applications in optimization
• On the complexity of rainbow spanning forest problem
• Optimal pathway reconstruction on 3D NMR maps
• Variable neighbourhood search for the minimum labelling Steiner tree problem
• On the minimum monochromatic or multicolored subgraph partition problems
• A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
• Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem
• The Colorful Traveling Salesman Problem
• The Rainbow Cycle Cover Problem
• Solution of a Large-Scale Traveling-Salesman Problem
• The Orderly Colored Longest Path Problem – a survey of applications and new algorithms
• Multicolored trees in complete graphs
• Multicolored forests in complete bipartite graphs
• OMEGA one multi ethnic genetic approach

This page was built for publication: The rainbow spanning forest problem