ColPack

ColPack: Software for graph coloring and related problems in scientific computing. ColPack is a package comprising of implementation of algorithms for specialized vertex coloring problems that arise in sparse derivative computation. It is written in an object-oriented fashion heavily using the Standard Template Library (STL). It is designed to be simple, modular, extenable and efficient.


References in zbMATH (referenced in 22 articles )

Showing results 1 to 20 of 22.
Sorted by year (citations)

1 2 next

  1. Dunning, Iain; Huchette, Joey; Lubin, Miles: JuMP: a modeling language for mathematical optimization (2017)
  2. Braga, Mónica; Marenco, Javier: Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope (2016)
  3. Gower, R. M.; Gower, A. L.: Higher-order reverse automatic differentiation with emphasis on the third-order (2016)
  4. Hasan, Mahmudul; Hossain, Shahadat; Khan, Ahamad Imtiaz; Mithila, Nasrin Hakim; Suny, Ashraful Huq: DSJM: a software toolkit for direct determination of sparse Jacobian matrices (2016)
  5. Hojny, Christopher; Pfetsch, Marc E.: A polyhedral investigation of star colorings (2016)
  6. Wang, Mu; Gebremedhin, Assefaw; Pothen, Alex: Capitalizing on \itlive variables: new algorithms for efficient Hessian computation via automatic differentiation (2016)
  7. Zhu, Enqiang; Li, Zepeng; Shao, Zehui; Xu, Jin; Liu, Chanjuan: Acyclic 3-coloring of generalized Petersen graphs (2016)
  8. Fiedorowicz, Anna; Sidorowicz, Elżbieta: Acyclic improper colouring of graphs with maximum degree 4 (2014)
  9. Kchouk, Bilel; Dussault, Jean-Pierre: On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians (2014)
  10. Gebremedhin, Assefaw H.; Nguyen, Duc; Patwary, Md. Mostofa Ali; Pothen, Alex: ColPack, software for graph coloring and related problems in scientific computing (2013)
  11. Mondal, Debajyoti; Nishat, Rahnuma Islam; Rahman, Md. Saidur; Whitesides, Sue: Acyclic coloring with few division vertices (2013)
  12. Angelini, Patrizio; Frati, Fabrizio: Acyclically 3-colorable planar graphs (2012)
  13. Borowiecki, Mieczysław; Fiedorowicz, Anna: $\cal Q$-Ramsey classes of graphs (2012)
  14. Braga, Mónica; Donne, Diego Delle; Marenco, Javier: A polyhedral study of the acyclic coloring problem (2012)
  15. Mondal, Debajyoti; Nishat, Rahnuma Islam; Whitesides, Sue; Rahman, Md. Saidur: Acyclic colorings of graph subdivisions revisited (2012)
  16. Narayanan, Sri Hari Krishna; Norris, Boyana; Hovland, Paul; Gebremedhin, Assefaw: Implementation of partial separability in a source-to-source transformation AD tool (2012)
  17. Walther, Andrea: On the efficient computation of sparsity patterns for Hessians (2012)
  18. Younis, Rami M.; Tchelepi, Hamdi A.: Lazy K-way linear combination kernels for efficient runtime sparse Jacobian matrix evaluations in C++ (2012)
  19. Braga, Mónica; Marenco, Javier: Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope (2011)
  20. Bozdağ, Doruk; Çatalyürek, Ümit V.; Gebremedhin, Assefaw H.; Manne, Fredrik; Boman, Erik G.; Özgüner, Füsun: Distributed-memory parallel algorithms for distance-2 coloring and related problems in derivative computation (2010)

1 2 next