Testing the Diameter of Graphs

Michal Parnas; Dana Ron

doi:10.1002/rsa.10013

Testing the Diameter of Graphs

Michal Parnas, Dana Ron^*

^*Corresponding author for this work

School of Electrical Engineering

Research output: Contribution to journal › Article › peer-review

Abstract

We propose a general model for testing graph properties, which extends and simplifies the bounded degree model of Goldreich and Ron [Property Testing in Bounded Degree Graphs, Proc. 31st Annual ACM Symposium on the Theory of Computing, 1997, pp. 406-415.] In this model, we present a family of algorithms that test whether the diameter of a graph is bounded by a given parameter D, or is ∈-far from any graph with diameter at most β(D). The function β(D) ranges between D + 4 and 4D + 2, depending on the algorithm. All our algorithms run in time polynomial in 1/∈.

Original language	English
Pages (from-to)	165-183
Number of pages	19
Journal	Random Structures and Algorithms
Volume	20
Issue number	2
DOIs	https://doi.org/10.1002/rsa.10013
State	Published - Mar 2002

Keywords

Approximation algorithms
Graph algorithms
Property testing

Access to Document

10.1002/rsa.10013

Cite this

@article{921666c76cf84589a6fe9aef8c5adeae,

title = "Testing the Diameter of Graphs",

abstract = "We propose a general model for testing graph properties, which extends and simplifies the bounded degree model of Goldreich and Ron [Property Testing in Bounded Degree Graphs, Proc. 31st Annual ACM Symposium on the Theory of Computing, 1997, pp. 406-415.] In this model, we present a family of algorithms that test whether the diameter of a graph is bounded by a given parameter D, or is ∈-far from any graph with diameter at most β(D). The function β(D) ranges between D + 4 and 4D + 2, depending on the algorithm. All our algorithms run in time polynomial in 1/∈.",

keywords = "Approximation algorithms, Graph algorithms, Property testing",

author = "Michal Parnas and Dana Ron",

year = "2002",

month = mar,

doi = "10.1002/rsa.10013",

language = "אנגלית",

volume = "20",

pages = "165--183",

journal = "Random Structures and Algorithms",

issn = "1042-9832",

publisher = "John Wiley and Sons Ltd",

number = "2",

}

TY - JOUR

T1 - Testing the Diameter of Graphs

AU - Parnas, Michal

AU - Ron, Dana

PY - 2002/3

Y1 - 2002/3

N2 - We propose a general model for testing graph properties, which extends and simplifies the bounded degree model of Goldreich and Ron [Property Testing in Bounded Degree Graphs, Proc. 31st Annual ACM Symposium on the Theory of Computing, 1997, pp. 406-415.] In this model, we present a family of algorithms that test whether the diameter of a graph is bounded by a given parameter D, or is ∈-far from any graph with diameter at most β(D). The function β(D) ranges between D + 4 and 4D + 2, depending on the algorithm. All our algorithms run in time polynomial in 1/∈.

AB - We propose a general model for testing graph properties, which extends and simplifies the bounded degree model of Goldreich and Ron [Property Testing in Bounded Degree Graphs, Proc. 31st Annual ACM Symposium on the Theory of Computing, 1997, pp. 406-415.] In this model, we present a family of algorithms that test whether the diameter of a graph is bounded by a given parameter D, or is ∈-far from any graph with diameter at most β(D). The function β(D) ranges between D + 4 and 4D + 2, depending on the algorithm. All our algorithms run in time polynomial in 1/∈.

KW - Approximation algorithms

KW - Graph algorithms

KW - Property testing

UR - http://www.scopus.com/inward/record.url?scp=0036114977&partnerID=8YFLogxK

U2 - 10.1002/rsa.10013

DO - 10.1002/rsa.10013

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0036114977

SN - 1042-9832

VL - 20

SP - 165

EP - 183

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

IS - 2

ER -

Testing the Diameter of Graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this