Published in: LIPIcs, Volume 221, 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)
Kathrin Hanauer, Monika Henzinger, and Qi Cheng Hua. Fully Dynamic Four-Vertex Subgraph Counting. In 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 221, pp. 18:1-18:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{hanauer_et_al:LIPIcs.SAND.2022.18, author = {Hanauer, Kathrin and Henzinger, Monika and Hua, Qi Cheng}, title = {{Fully Dynamic Four-Vertex Subgraph Counting}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {18:1--18:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.18}, URN = {urn:nbn:de:0030-drops-159608}, doi = {10.4230/LIPIcs.SAND.2022.18}, annote = {Keywords: Dynamic Graph Algorithms, Subgraph Counting, Motif Search} }
Feedback for Dagstuhl Publishing