Showing 1 - 20 results of 23 for search '"bipartite graph"', query time: 0.07s Refine Results
  1. 1
  2. 2
  3. 3
  4. 4

    Combinatorial scientific computing / by Naumann, Uwe, 1969-, Schenk, Olaf, 1967-

    Published c201
    “…Several discrete combinatorial problems and data structures, such as graph and hypergraph partitioning, supernodes and elimination trees, vertex and edge reordering, vertex and edge coloring, and bipartite graph matching, arise in these contexts. As an example, parallel partitioning tools can be used to ease the task of distributing the computational workload across the processors. …”
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20