📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

Approximating the Caro-Wei Bound for Independent Sets in Graph Streams

First Author: Cormode G

Attributed to: The Alan Turing Institute funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/978-3-319-96151-4_9

Publication URI: http://dx.doi.org/10.1007/978-3-319-96151-4_9

Type: Book Chapter

Book Title: Combinatorial Optimization - 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers (2018)

Page Reference: 101-114