Abstract
The implementation of a graph generator associated with the estimation of mathematical derivatives is described. The graph colouring instances are obtained as intersection graphs G Π(A) of the sparsity pattern of A∈ℜ m×n with row partition Π. The size of the graph is dependent on the row partition; the number of vertices can be varied between the number of columns (using single block row partition Π=Π1) and the number of nonzero entries of A (using m-block row partition Π=Π m ). The chromatic number of the generated graph instances satisfy . A summary of colouring results on the ColSegSet problems is presented. We also show that the main idea of the graph instance generator can be extended to general undirected graphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
