English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Counting Arbitrary Subgraphs in Data Streams

MPS-Authors
/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45356

Sauerwald,  Thomas
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45576

Sun,  He
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Kane, D., Mehlhorn, K., Sauerwald, T., & Sun, H. (2012). Counting Arbitrary Subgraphs in Data Streams. In A. Czumaj, K. Mehlhorn, A. M. Pitts, & R. Wattenhofer (Eds.), Automata, Languages, and Programming (pp. 598-609). Berlin: Springer. doi:10.1007/978-3-642-31585-5.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-BDD7-D
Abstract
There is no abstract available