CsegGraph: a graph colouring instance generator

DOI10.1080/00207160903023565zbMath1190.05070OpenAlexW2050600071MaRDI QIDQ3643182

Shahadat Hossain

Publication date: 10 November 2009

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160903023565

zbMATH Keywords

sparse matrixcolumn-segments graphmathematical derivative

Mathematics Subject Classification ID

Nonlinear programming (90C30) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Inverse optimization for assessing emerging technologies in breast cancer screening ⋮ CsegGraph ⋮ Optimal direct determination of sparse Jacobian matrices

Uses Software

• IML++
• MatrixMarket

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A cutting plane algorithm for graph coloring
• An ant-based algorithm for coloring graphs
• Coloring graphs by iterated local search traversing feasible and infeasible solutions
• Another look at graph coloring via propositional satisfiability
• An adaptive memory algorithm for the \(k\)-coloring problem
• Graph coloring in the estimation of sparse derivative matrices: Instances and applications
• A branch-and-cut algorithm for graph coloring
• Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
• Estimation of Sparse Jacobian Matrices
• Software for estimating sparse Jacobian matrices
• Sparse matrix test problems
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• New methods to color the vertices of a graph
• A Column Generation Approach for Graph Coloring
• What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
• Frozen development in graph coloring

This page was built for publication: CsegGraph: a graph colouring instance generator