Diameter determination on restricted graph families
- 15 October 2001
- journal article
- Published by Elsevier BV in Discrete Applied Mathematics
- Vol. 113 (2-3), 143-166
- https://doi.org/10.1016/s0166-218x(00)00281-x
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problemDiscrete Applied Mathematics, 2000
- Almost diameter of a house-hole-free graph in linear time via LexBFSDiscrete Applied Mathematics, 1999
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)SIAM Journal on Computing, 1999
- Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free GraphsSIAM Journal on Computing, 1999
- Asteroidal Triple-Free GraphsSIAM Journal on Discrete Mathematics, 1997
- On Distances in Benzenoid SystemsJournal of Chemical Information and Computer Sciences, 1996
- The algorithmic use of hypertree structure and maximum neighbourhood orderingsLecture Notes in Computer Science, 1995
- Optimal (parallel) algorithms for the all-to-all vertices distance problem for certain graph classesLecture Notes in Computer Science, 1993
- Matrix multiplication via arithmetic progressionsPublished by Association for Computing Machinery (ACM) ,1987
- A characterisation of rigid circuit graphsDiscrete Mathematics, 1974