Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference25 articles.
1. A. Abboud, J. Wang, V. Vassilevska Williams, Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs, in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, 2016, pp. 377–391.
2. Into the square - on the complexity of quadratic-time solvable problems;Borassi;Electron. Notes Theor. Comput. Sci.,2016
3. Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games;Borassi;Theoret. Comput. Sci.,2015
4. Lexbfs-orderings and powers of chordal graphs;Brandstadt;Discrete Math.,1997
5. Graph Classes, a Survey;Brandstadt,1999