References in zbMATH (referenced in 13 articles )

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

  1. Fairbrother, Jamie; Letchford, Adam N.; Briggs, Keith: A two-level graph partitioning problem arising in mobile wireless communications (2018)
  2. Maurer, Daniel; Wieners, Christian: A scalable parallel factorization of finite element matrices with distributed Schur complements. (2016)
  3. Meyerhenke, Henning; Sanders, Peter; Schulz, Christian: Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering (2016)
  4. Baumstark, Niklas; Blelloch, Guy; Shun, Julian: Efficient implementation of a synchronous parallel push-relabel algorithm (2015)
  5. Delling, Daniel; Fleischman, Daniel; Goldberg, Andrew V.; Razenshteyn, Ilya; Werneck, Renato F.: An exact combinatorial algorithm for minimum graph bisection (2015)
  6. Younes, Ahmed: A bounded-error quantum polynomial-time algorithm for two graph bisection problems (2015)
  7. Ceselli, Alberto; Colombo, Fabio; Cordone, Roberto; Trubian, Marco: Employee workload balancing by graph partitioning (2014)
  8. Colombo, Fabio; Cordone, Roberto; Trubian, Marco: Column-generation based bounds for the homogeneous areas problem (2014)
  9. Duan, Ran; Pettie, Seth: Linear-time approximation for maximum weight matching (2014)
  10. Luxen, Dennis; Schieferdecker, Dennis: Candidate sets for alternative routes in road networks (2014)
  11. Safro, Ilya; Sanders, Peter; Schulz, Christian: Advanced coarsening schemes for graph partitioning (2014)
  12. Sanders, Peter; Schulz, Christian: Engineering multilevel graph partitioning algorithms (2011)
  13. Tremel, U.; Sørensen, K. A.; Hitzel, S.; Rieger, H.; Hassan, Oubay; Weatherill, Nigel P.: Parallel remeshing of unstructured volume grids for CFD applications (2007)