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
Characterization of graphs dominated by induced paths, Discrete Mathematics, vol.307, issue.7-8, pp.822-826, 2007. ,
DOI : 10.1016/j.disc.2005.11.035
On the power of BFS to determine a graph's diameter, Networks, vol.2161, issue.4, pp.209-222, 2003. ,
DOI : 10.1002/net.10098
A linear time algorithm to compute a dominating path in an AT-free graph, Information Processing Letters, vol.54, issue.5, pp.253-2570020, 1995. ,
DOI : 10.1016/0020-0190(95)00021-4
Asteroidal triple-free graphs, p.0895480193250125, 1997. ,
Linear time algorithms for dominating pairs in asteroidal triple-free graphs, SIAM J. Comput, vol.28, issue.4, pp.1284-1297, 1999. ,
DOI : 10.1007/3-540-60084-1_82
Diametral path graphs Graph- Theoretic Concepts in Computer Science, 21st International Workshop, WG '95, Proceedings. Lecture Notes in Computer Science, pp.344-357, 1995. ,
Dominating Pair Graphs, SIAM Journal on Discrete Mathematics, vol.15, issue.3, pp.353-366, 2002. ,
DOI : 10.1137/S0895480100367111
On the Minimum Eccentricity Shortest Path Problem, Algorithms and Data Structures -14th International Symposium, WADS 2015, pp.276-288, 2015. ,
DOI : 10.1007/978-3-319-21840-3_23
Representation of a finite graph by a set of intervals on the real line, Fund. Math, vol.51, pp.45-64, 1962. ,
Graph minors. I. Excluding a forest, Journal of Combinatorial Theory, Series B, vol.35, issue.1, pp.39-610095, 1983. ,
DOI : 10.1016/0095-8956(83)90079-5
Read networks and k-laminar graphs, 2016. ,
Isomorphism for graphs of bounded distance width, Third Italian Conference, CIAC '97, pp.276-287, 1997. ,
DOI : 10.1007/3-540-62592-5_79
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.29, issue.1, pp.40-51, 2007. ,
DOI : 10.1109/TPAMI.2007.250598