Approximating the Caro-Wei Bound for Independent Sets in Graph Streams. Cormode, G., Dark, J., & Konrad, C. In Lee, J., Rinaldi, G., & Mahjoub, A. R., editors, Combinatorial Optimization - 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers, volume 10856, of Lecture Notes in Computer Science, pages 101–114, 2018. Springer. Paper doi bibtex @inproceedings{DBLP:conf/iscopt/CormodeDK18,
author = {Graham Cormode and
Jacques Dark and
Christian Konrad},
editor = {Jon Lee and
Giovanni Rinaldi and
Ali Ridha Mahjoub},
title = {Approximating the Caro-Wei Bound for Independent Sets in Graph Streams},
booktitle = {Combinatorial Optimization - 5th International Symposium, {ISCO} 2018,
Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10856},
pages = {101--114},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-96151-4\_9},
doi = {10.1007/978-3-319-96151-4\_9},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iscopt/CormodeDK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
Downloads: 0
{"_id":"jmeQvx7oYkNh4PfJR","bibbaseid":"cormode-dark-konrad-approximatingthecaroweiboundforindependentsetsingraphstreams-2018","author_short":["Cormode, G.","Dark, J.","Konrad, C."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Graham"],"propositions":[],"lastnames":["Cormode"],"suffixes":[]},{"firstnames":["Jacques"],"propositions":[],"lastnames":["Dark"],"suffixes":[]},{"firstnames":["Christian"],"propositions":[],"lastnames":["Konrad"],"suffixes":[]}],"editor":[{"firstnames":["Jon"],"propositions":[],"lastnames":["Lee"],"suffixes":[]},{"firstnames":["Giovanni"],"propositions":[],"lastnames":["Rinaldi"],"suffixes":[]},{"firstnames":["Ali","Ridha"],"propositions":[],"lastnames":["Mahjoub"],"suffixes":[]}],"title":"Approximating the Caro-Wei Bound for Independent Sets in Graph Streams","booktitle":"Combinatorial Optimization - 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers","series":"Lecture Notes in Computer Science","volume":"10856","pages":"101–114","publisher":"Springer","year":"2018","url":"https://doi.org/10.1007/978-3-319-96151-4_9","doi":"10.1007/978-3-319-96151-4_9","timestamp":"Tue, 14 May 2019 10:00:53 +0200","biburl":"https://dblp.org/rec/conf/iscopt/CormodeDK18.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/iscopt/CormodeDK18,\n author = {Graham Cormode and\n Jacques Dark and\n Christian Konrad},\n editor = {Jon Lee and\n Giovanni Rinaldi and\n Ali Ridha Mahjoub},\n title = {Approximating the Caro-Wei Bound for Independent Sets in Graph Streams},\n booktitle = {Combinatorial Optimization - 5th International Symposium, {ISCO} 2018,\n Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers},\n series = {Lecture Notes in Computer Science},\n volume = {10856},\n pages = {101--114},\n publisher = {Springer},\n year = {2018},\n url = {https://doi.org/10.1007/978-3-319-96151-4\\_9},\n doi = {10.1007/978-3-319-96151-4\\_9},\n timestamp = {Tue, 14 May 2019 10:00:53 +0200},\n biburl = {https://dblp.org/rec/conf/iscopt/CormodeDK18.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Cormode, G.","Dark, J.","Konrad, C."],"editor_short":["Lee, J.","Rinaldi, G.","Mahjoub, A. R."],"key":"DBLP:conf/iscopt/CormodeDK18","id":"DBLP:conf/iscopt/CormodeDK18","bibbaseid":"cormode-dark-konrad-approximatingthecaroweiboundforindependentsetsingraphstreams-2018","role":"author","urls":{"Paper":"https://doi.org/10.1007/978-3-319-96151-4_9"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://dblp.org/pid/15/8910.bib","dataSources":["mYxb3K3dbLnhBPPJo"],"keywords":[],"search_terms":["approximating","caro","wei","bound","independent","sets","graph","streams","cormode","dark","konrad"],"title":"Approximating the Caro-Wei Bound for Independent Sets in Graph Streams","year":2018}