( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Parallel Maximum Clique Algorithms with Applications to Network Analysis.

, , и . SIAM J. Sci. Comput., (2015)

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.

NULL Yitagessu Birhanu Gebremedhin

 

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

A Fast Parallel Maximum Clique Algorithm for Large Sparse Graphs and Temporal Strong Components, , , и . CoRR, (2013)A framework for scalable greedy coloring on distributed-memory parallel computers., , , , и . J. Parallel Distributed Comput., 68 (4): 515-535 (2008)Parallel Maximum Clique Algorithms with Applications to Network Analysis., , и . SIAM J. Sci. Comput., (2015)Fast maximum clique algorithms for large graphs., , , и . WWW (Companion Volume), стр. 365-366. ACM, (2014)What Color Is Your Jacobian? Graph Coloring for Computing Derivatives., , и . SIAM Rev., 47 (4): 629-705 (2005)Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection., , , , и . Internet Math., 11 (4-5): 421-448 (2015)The Enabling Power of Graph Coloring Algorithms in Automatic Differentiation and Parallel Processing.. Combinatorial Scientific Computing, том 09061 из Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)Lucid Dreaming for Experience Replay: Refreshing Past States with the Current Policy., , , , и . CoRR, (2020)Capitalizing on live variables: new algorithms for efficient Hessian computation via automatic differentiation., , и . Math. Program. Comput., 8 (4): 393-433 (2016)Speeding up Parallel Graph Coloring., , и . PARA, том 3732 из Lecture Notes in Computer Science, стр. 1079-1088. Springer, (2004)