( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem.

, и . PPAM, том 4967 из Lecture Notes in Computer Science, стр. 708-717. Springer, (2007)

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.

Manne Loewensohn

Wilhelm Manne

Horst Männe

Fredrik Borchsenius

Fredrik Albach

 

Другие публикации лиц с тем же именем

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