From post

The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections.

, , , , и . SISAP, том 13058 из Lecture Notes in Computer Science, стр. 337-351. Springer, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Quasimetric Graph Edit Distance as a Compact Quadratic Assignment Problem., , , , и . ICPR, стр. 934-939. IEEE Computer Society, (2018)Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching., , , и . Inf. Sci., (2022)The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections Extended Version., , , , и . CoRR, (2021)Federated Principal Component Analysis for Genome-Wide Association Studies., , , и . ICDM, стр. 1090-1095. IEEE, (2021)Scalable generalized median graph estimation and its manifold use in bioinformatics, clustering, classification, and indexing., , , , , и . Inf. Syst., (2021)Querying Temporal Anomalies in Healthcare Information Systems and Beyond., , , , и . ADBIS, том 13389 из Lecture Notes in Computer Science, стр. 209-222. Springer, (2022)NApy: Efficient Statistics in Python for Large-Scale Heterogeneous Data with Enhanced Support for Missing Data., , , , и . CoRR, (мая 2025)BiCoN: Network-constrained biclustering of patients and omics data, , , , , , , , и . bioRxiv, (2020)Robust disease module mining via enumeration of diverse prize-collecting Steiner trees, , , , , , , и . Bioinformatics, 38 (6): 1600-1606 (января 2022)Correcting and Speeding-Up Bounds for Non-Uniform Graph Edit Distance., и . ICDE, стр. 131-134. IEEE Computer Society, (2017)