Suchergebnisse - "constant-time approximation algorithms"

Testable Bounded Degree Graph Properties Are Random Order Streamable

Autoren: Monemizadeh, Morteza Muthukrishnan, S. Peng, Pan et al.

Weitere Verfasser: Monemizadeh, Morteza Muthukrishnan, S. Peng, Pan et al.

Schlagwörter: FOS: Computer and information sciences, 0102 computer and information sciences, 02 engineering and technology, graph property testing, Graph streaming algorithms, constant-time approximation algorithms, 01 natural sciences, 102031 Theoretische Informatik, Graph property testing, 102031 Theoretical computer science, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Constant-time approximation algorithms, Data Structures and Algorithms (cs.DS), ddc:004

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/1707.07334
https://ucrisportal.univie.ac.at/de/publications/646d2fe2-7982-4707-ae83-96526d4c8829
https://doi.org/10.4230/LIPIcs.ICALP.2017.131
https://drops.dagstuhl.de/opus/volltexte/2017/7478/pdf/LIPIcs-ICALP-2017-131.pdf/
https://nyuscholars.nyu.edu/en/publications/testable-bounded-degree-graph-properties-are-random-order-streama
https://eprints.whiterose.ac.uk/148804/
https://doi.org/10.4230/LIPIcs.ICALP.2017.131
https://drops.dagstuhl.de/opus/volltexte/2017/7478/
https://arxiv.org/abs/1707.07334
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.131