, Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter, SIAM, pp.1681-1697, 2015.
DOI : 10.1137/1.9781611973730.112
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.698.5221
, Approximation and fixed parameter subquadratic algorithms for radius and diameter, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016.
DOI : 10.1137/1.9781611974331.ch28
, Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication), SIAM Journal on Computing, vol.28, issue.4, pp.1167-1181, 1999.
DOI : 10.1137/S0097539796303421
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.2824
, On the Exponent of the All Pairs Shortest Path Problem, Journal of Computer and System Sciences, vol.54, issue.2, pp.255-262, 1997.
DOI : 10.1006/jcss.1997.1388
, Fast and Simple Approximation of the Diameter and Radius of a Graph, WEA, pp.98-108, 2006.
DOI : 10.1007/11764298_9
, Computing extremal and approximate distances in graphs having unit cost edges, Acta Informatica, vol.15, pp.319-328, 1981.
, Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs, Theoretical Computer Science, vol.586, pp.59-80, 2015.
DOI : 10.1016/j.tcs.2015.02.033
URL : https://hal.archives-ouvertes.fr/hal-01248555
, More Algorithms for All-Pairs Shortest Paths in Weighted Graphs, SIAM Journal on Computing, vol.39, issue.5, pp.2075-2089, 2010.
DOI : 10.1137/08071990X
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.6864
, All-pairs shortest paths for unweighted undirected graphs in o(mn) time, ACM Transactions on Algorithms, vol.8, issue.4, p.34, 2012.
DOI : 10.1145/2344422.2344424
, Better Approximation Algorithms for the Graph Diameter, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms , SODA 2014, pp.1041-1052, 2014.
DOI : 10.1137/1.9781611973402.78
, Algorithmic Applications of Baur-Strassen???s Theorem, Proceedings of the 2012 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2012, pp.531-540, 2012.
DOI : 10.1145/2736283
URL : http://doi.org/10.1145/2736283
, Total Domination in Graphs with Diameter 2, Journal of Graph Theory, vol.27, issue.1, pp.91-103, 2014.
DOI : 10.1002/jgt.21725
, All-Pairs Almost Shortest Paths, SIAM Journal on Computing, vol.29, issue.5, pp.1740-1759, 2000.
DOI : 10.1137/S0097539797327908
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.7787
, New bounds on the complexity of the shortest path problem, SIAM Journal on Computing, vol.5, issue.1, pp.83-89, 1976.
, Networks Cannot Compute Their Diameter in Sublinear Time, SIAM, pp.1150-1162, 2012.
DOI : 10.1137/1.9781611973099.91
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.231.5080
, All Pairs Shortest Paths for Graphs with Small Integer Length Edges, Journal of Computer and System Sciences, vol.54, issue.2, pp.243-254, 1997.
DOI : 10.1006/jcss.1997.1385
URL : http://doi.org/10.1006/jcss.1997.1385
, Fundamentals of Domination in Graphs. Springer monographs in mathematics, 1998.
, Total domination in graphs. Springer monographs in mathematics
, Which problems have strongly exponential complexity?, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), pp.512-530, 2001.
DOI : 10.1109/SFCS.1998.743516
URL : http://doi.org/10.1006/jcss.2001.1774
, Finding the hidden path: Time bounds for all-pairs shortest paths, SIAM Journal on Computing, vol.22, issue.6, pp.1199-1217, 1993.
, Fast computation of empirically tight bounds for the diameter of massive graphs, Journal of Experimental Algorithmics, vol.13, 2008.
DOI : 10.1145/1412228.1455266
URL : https://hal.archives-ouvertes.fr/hal-01146069
, A new approach to all-pairs shortest paths on real-weighted graphs, Theoretical Computer Science, vol.312, issue.1, pp.47-74, 2004.
DOI : 10.1016/S0304-3975(03)00402-X
URL : http://doi.org/10.1016/s0304-3975(03)00402-x
, Fast approximation algorithms for the diameter and radius of sparse graphs Seidel. On the all-pairs-shortest-path problem in unweighted undirected graphs, ACM, editor, STOC '13: Proceedings of the Forty-fifth Annual ACM Symposium on Theory of Computing, pp.515-524400, 1995.
, All pairs shortest paths in undirected graphs with integer weights, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), pp.605-614, 1999.
DOI : 10.1109/SFFCS.1999.814635
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.4606
, An time algorithm for the all-pairs shortest path problem, Information Processing Letters, vol.96, issue.5, pp.155-161, 2005.
DOI : 10.1016/j.ipl.2005.08.008
, Approximating the Diameter of Planar Graphs in Near Linear Time, ACM Transactions on Algorithms, vol.12, issue.1, pp.828-839, 2013.
DOI : 10.1145/2764910
, A New Algorithm for Optimal Constraint Satisfaction and Its Implications, Automata, Languages and Programming: 31st International Colloquium, pp.1227-1237, 2004.
DOI : 10.1007/978-3-540-27836-8_101
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.304.7307
, Computing the diameter polynomially faster than APSP, 2010.
, All pairs shortest paths in weighted directed graphs-exact and almost exact algorithms, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), pp.310-319, 1998.
DOI : 10.1109/SFCS.1998.743464
, Exact and Approximate Distances in Graphs ??? A Survey, Lecture Notes in Computer Science, vol.2161, pp.33-48, 2001.
DOI : 10.1007/3-540-44676-1_3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.5213
, All pairs shortest paths using bridging sets and rectangular matrix multiplication, Journal of the ACM, vol.49, issue.3, pp.289-317, 2002.
DOI : 10.1145/567112.567114
URL : http://arxiv.org/abs/cs/0008011