Sublinear-time algorithms for approximating graph parameters

Dana Ron

doi:10.1007/978-3-319-91908-9_7

Sublinear-time algorithms for approximating graph parameters

Dana Ron^*

^*Corresponding author for this work

School of Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

5 Scopus citations

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher	Springer
Pages	105-122
Number of pages	18
DOIs	https://doi.org/10.1007/978-3-319-91908-9_7
State	Published - 2019

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	10000
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Funding

Funders	Funder number
Israel Science Foundation	671/13.1

Access to Document

10.1007/978-3-319-91908-9_7

Cite this

Ron, D. (2019). Sublinear-time algorithms for approximating graph parameters. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 105-122). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10000). Springer. https://doi.org/10.1007/978-3-319-91908-9_7

Ron, Dana. / Sublinear-time algorithms for approximating graph parameters. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer, 2019. pp. 105-122 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{9dabf72c9b0647eea1826989437e73a5,

title = "Sublinear-time algorithms for approximating graph parameters",

author = "Dana Ron",

note = "Funding Information: D. Ron—Research supported by the Israel Science Foundation grant no. 671/13.1 Observe that a degree query to a vertex v can be replaced by O(log d(v)) neighbor queries to v by performing a “doubling” search. For the sake of simplicity we allow both types of queries.",

year = "2019",

doi = "10.1007/978-3-319-91908-9_7",

language = "אנגלית",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "105--122",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

Ron, D 2019, Sublinear-time algorithms for approximating graph parameters. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10000, Springer, pp. 105-122. https://doi.org/10.1007/978-3-319-91908-9_7

Sublinear-time algorithms for approximating graph parameters. / Ron, Dana.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer, 2019. p. 105-122 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10000).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Sublinear-time algorithms for approximating graph parameters

AU - Ron, Dana

N1 - Funding Information: D. Ron—Research supported by the Israel Science Foundation grant no. 671/13.1 Observe that a degree query to a vertex v can be replaced by O(log d(v)) neighbor queries to v by performing a “doubling” search. For the sake of simplicity we allow both types of queries.

PY - 2019

Y1 - 2019

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

U2 - 10.1007/978-3-319-91908-9_7

DO - 10.1007/978-3-319-91908-9_7

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???

AN - SCOPUS:85087442732

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 105

EP - 122

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer

ER -

Ron D. Sublinear-time algorithms for approximating graph parameters. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer. 2019. p. 105-122. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-91908-9_7

Sublinear-time algorithms for approximating graph parameters

Publication series

Funding

Access to Document

Other files and links

Cite this