Author of the publication

An Exact Algorithm for Diameters of Large Real Directed Graphs.

, , and . SEA, volume 9125 of Lecture Notes in Computer Science, page 56-67. Springer, (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.

 

Other publications of authors with the same name

Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling., , , , and . AAAI, page 2-8. AAAI Press, (2015)BDD-Constrained A* Search: A Fast Method for Solving Constrained DAG Shortest-Path Problems., , , , , and . AAAI Workshops, volume WS-17 of AAAI Technical Report, AAAI Press, (2017)An Exact Algorithm for Diameters of Large Real Directed Graphs., , and . SEA, volume 9125 of Lecture Notes in Computer Science, page 56-67. Springer, (2015)Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover., and . ALENEX, page 70-81. SIAM, (2015)Evolutionary Optimization of Model Merging Recipes., , , , and . CoRR, (2024)Compact and Scalable Graph Neighborhood Sketching., and . KDD, page 685-694. ACM, (2016)Variance-based Gradient Compression for Efficient Distributed Deep Learning., , and . ICLR (Workshop), OpenReview.net, (2018)Network structural analysis via core-tree-decomposition Publication of this article pending inquiry., , and . KDD, page 1476-1485. ACM, (2014)MN-Core - A Highly Efficient and Scalable Approach to Deep Learning., , , , , , , , , and 16 other author(s). VLSI Circuits, page 1-2. IEEE, (2021)Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction., , and . CIKM, page 909-918. ACM, (2013)