Testing the Diameter of Graphs
- 1 January 1999
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Sparse partitionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Testing the Diameter of GraphsPublished by Springer Nature ,1999
- Testing problems with sub-learning sample complexityPublished by Association for Computing Machinery (ACM) ,1998
- Property testing and its connection to learning and approximationJournal of the ACM, 1998
- Property testing in bounded degree graphsPublished by Association for Computing Machinery (ACM) ,1997
- Robust Characterizations of Polynomials with Applications to Program TestingSIAM Journal on Computing, 1996
- Low diameter graph decompositionsCombinatorica, 1993
- On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problemsOperations Research Letters, 1992
- Complexity of network synchronizationJournal of the ACM, 1985
- A simple heuristic for the p-centre problemOperations Research Letters, 1985