( en | de | ru )

 

Disambiguation of "Manne, Fredrik"

Author of the publication

copydeleteadd this publication to your clipboard
On parallel push-relabel based algorithms for bipartite maximum matching.

, , , and . Parallel Comput., 40 (7): 289-308 (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Manne Loewensohn

Wilhelm Manne

Horst Männe

Fredrik Borchsenius

Fredrik Albach

 

Other publications of authors with the same name

Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure., , and . SEA, volume 6049 of Lecture Notes in Computer Science, page 411-423. Springer, (2010)Push-relabel based algorithms for the maximum transversal problem., , , and . Comput. Oper. Res., 40 (5): 1266-1275 (2013)A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem., and . PPAM, volume 4967 of Lecture Notes in Computer Science, page 708-717. Springer, (2007)On parallel push-relabel based algorithms for bipartite maximum matching., , , and . Parallel Comput., 40 (7): 289-308 (2014)What Color Is Your Jacobian? Graph Coloring for Computing Derivatives., , and . SIAM Rev., 47 (4): 629-705 (2005)Competing in computing (poster session).. ITiCSE, page 190. ACM, (2000)Efficient Generic Multi-Stage Self-Stabilizing Algorithms for Trees., and . PDCS, page 333-338. ISCA, (2004)Scalable b-Matching on GPUs., and . IPDPS Workshops, page 637-646. IEEE Computer Society, (2018)Efficient Self-stabilizing Graph Searching in Tree Networks., , and . SSS, volume 6366 of Lecture Notes in Computer Science, page 111-125. Springer, (2010)Multi-core Spanning Forest Algorithms using the Disjoint-set Data Structure., , and . IPDPS, page 827-835. IEEE Computer Society, (2012)