Can we locally compute sparse connected subgraphs?

Ronitt Rubinfeld

doi:10.1007/978-3-319-58747-9_6

Can we locally compute sparse connected subgraphs?

Ronitt Rubinfeld^*

^*Corresponding author for this work

School of Computer Science

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

Original language	English
Title of host publication	Computer Science - Theory and Applications - 12th International Computer Science Symposium in Russia, CSR 2017, Proceedings
Editors	Pascal Weil
Publisher	Springer Verlag
Pages	38-47
Number of pages	10
ISBN (Print)	9783319587462
DOIs	https://doi.org/10.1007/978-3-319-58747-9_6
State	Published - 2017
Event	12th International Computer Science Symposium in Russia, CSR 2017 - Kazan, Russian Federation Duration: 8 Jun 2017 → 12 Jun 2017

Publication series

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

Conference

Conference	12th International Computer Science Symposium in Russia, CSR 2017
Country/Territory	Russian Federation
City	Kazan
Period	8/06/17 → 12/06/17

Access to Document

10.1007/978-3-319-58747-9_6

Cite this

Rubinfeld, R. (2017). Can we locally compute sparse connected subgraphs? In P. Weil (Ed.), Computer Science - Theory and Applications - 12th International Computer Science Symposium in Russia, CSR 2017, Proceedings (pp. 38-47). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10304 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-58747-9_6

Rubinfeld, Ronitt. / Can we locally compute sparse connected subgraphs?. Computer Science - Theory and Applications - 12th International Computer Science Symposium in Russia, CSR 2017, Proceedings. editor / Pascal Weil. Springer Verlag, 2017. pp. 38-47 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{0788126946ed457da97e9f4753049776,

title = "Can we locally compute sparse connected subgraphs?",

author = "Ronitt Rubinfeld",

note = "Funding Information: R. Rubinfeld—Supported by ISF grant 1147/09 and NSF grant CCF-1650733. ; 12th International Computer Science Symposium in Russia, CSR 2017 ; Conference date: 08-06-2017 Through 12-06-2017",

year = "2017",

doi = "10.1007/978-3-319-58747-9_6",

language = "אנגלית",

isbn = "9783319587462",

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

publisher = "Springer Verlag",

pages = "38--47",

editor = "Pascal Weil",

booktitle = "Computer Science - Theory and Applications - 12th International Computer Science Symposium in Russia, CSR 2017, Proceedings",

}

Rubinfeld, R 2017, Can we locally compute sparse connected subgraphs? in P Weil (ed.), Computer Science - Theory and Applications - 12th International Computer Science Symposium in Russia, CSR 2017, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10304 LNCS, Springer Verlag, pp. 38-47, 12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russian Federation, 8/06/17. https://doi.org/10.1007/978-3-319-58747-9_6

Can we locally compute sparse connected subgraphs? / Rubinfeld, Ronitt.
Computer Science - Theory and Applications - 12th International Computer Science Symposium in Russia, CSR 2017, Proceedings. ed. / Pascal Weil. Springer Verlag, 2017. p. 38-47 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10304 LNCS).

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