Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka. Maximal Intersection Queries in Randomized Graph Models. In Volker Diekert, Mikhail V. Volkov, Andrei Voronkov, editors, Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings. Volume 4649 of Lecture Notes in Computer Science, pages 227-236, Springer, 2007. [doi]
@inproceedings{HoffmannLN07,
title = {Maximal Intersection Queries in Randomized Graph Models},
author = {Benjamin Hoffmann and Yury Lifshits and Dirk Nowotka},
year = {2007},
doi = {10.1007/978-3-540-74510-5_24},
url = {http://dx.doi.org/10.1007/978-3-540-74510-5_24},
tags = {graph query, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/HoffmannLN07},
cites = {0},
citedby = {0},
pages = {227-236},
booktitle = {Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings},
editor = {Volker Diekert and Mikhail V. Volkov and Andrei Voronkov},
volume = {4649},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-74509-9},
}