( en | de | ru )

 

Disambiguation of "Gebremedhin, Assefaw Hadish"

Author of the publication

copydeleteadd this publication to your clipboard
Parallel Maximum Clique Algorithms with Applications to Network Analysis.

, , and . 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. You can also use the button next to the name to display some publications already assigned to the person.

NULL Yitagessu Birhanu Gebremedhin

 

Other publications of authors with the same name

Parallel Maximum Clique Algorithms with Applications to Network Analysis., , and . SIAM J. Sci. Comput., (2015)A Fast Parallel Maximum Clique Algorithm for Large Sparse Graphs and Temporal Strong Components, , , and . CoRR, (2013)A framework for scalable greedy coloring on distributed-memory parallel computers., , , , and . J. Parallel Distributed Comput., 68 (4): 515-535 (2008)Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection., , , , and . Internet Math., 11 (4-5): 421-448 (2015)What Color Is Your Jacobian? Graph Coloring for Computing Derivatives., , and . SIAM Rev., 47 (4): 629-705 (2005)The Enabling Power of Graph Coloring Algorithms in Automatic Differentiation and Parallel Processing.. Combinatorial Scientific Computing, volume 09061 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)Fast maximum clique algorithms for large graphs., , , and . WWW (Companion Volume), page 365-366. ACM, (2014)Speeding up Parallel Graph Coloring., , and . PARA, volume 3732 of Lecture Notes in Computer Science, page 1079-1088. Springer, (2004)Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection., , , , and . CoRR, (2014)Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs, , , , and . CoRR, (2012)