Testing subgraphs in directed graphs
- 30 November 2004
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 69 (3), 354-382
- https://doi.org/10.1016/j.jcss.2004.04.008
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Testing satisfiabilityJournal of Algorithms, 2003
- Three theorems regarding testing graph propertiesRandom Structures & Algorithms, 2003
- Testing k-colorabilitySIAM Journal on Discrete Mathematics, 2002
- Regular Languages are Testable with a Constant Number of QueriesSIAM Journal on Computing, 2001
- Quick Approximation to Matrices and ApplicationsCombinatorica, 1999
- Property testing and its connection to learning and approximationJournal of the ACM, 1998
- Robust Characterizations of Polynomials with Applications to Program TestingSIAM Journal on Computing, 1996
- The Algorithmic Aspects of the Regularity LemmaJournal of Algorithms, 1994
- The core of a graphDiscrete Mathematics, 1992
- The effect of two cycles on the complexity of colourings by directed graphsDiscrete Applied Mathematics, 1990