An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs

DOI10.1002/net.22031arXiv2006.02988OpenAlexW3133944896MaRDI QIDQ6065850

David Mildebrath, Illya V. Hicks, Unnamed Author

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.02988

zbMATH Keywords

graphinteger programmingcombinatorial optimizationgraph coloringheuristicstrong rainbow connection

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Breakout local search for maximum clique problems
• On the rainbow connectivity of graphs: complexity and FPT algorithms
• Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs
• Hardness and algorithms for rainbow connection
• A hybrid iterated local search heuristic for the maximum weight independent set problem
• Multi-neighborhood tabu search for the maximum weight clique problem
• Rainbow connections of graphs: a survey
• Algorithms and bounds for very strong rainbow coloring
• Rainbow connectivity using a rank genetic algorithm: Moore cages with girth six
• Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks
• The rainbow connectivity of a graph
• Rainbow connection in graphs
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree
• Collective dynamics of ‘small-world’ networks

This page was built for publication: An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs