Discovering Robustly Connected Subgraphs with Simple Descriptions

Janis Kalofolias, Mario Boley, Jilles Vreeken. Discovering Robustly Connected Subgraphs with Simple Descriptions. In Jianyong Wang, Kyuseok Shim, Xindong Wu 0001, editors, 2019 IEEE International Conference on Data Mining, ICDM 2019, Beijing, China, November 8-11, 2019. pages 1150-1155, IEEE, 2019. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.