( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
An Efficient Algorithm for Assessing the Number of st-Paths in Large Graphs.

, , , и . SDM, стр. 289-297. SIAM, (2023)

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.

Ralf Conte

Tobias Daniel Conte

Carla Conte

Alessio Langiu

Alessio Meneghetti

 

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

Polynomial-Delay Enumeration of Maximal Common Subsequences., , , и . SPIRE, том 11811 из Lecture Notes in Computer Science, стр. 189-202. Springer, (2019)Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection in Graphs., , , , и . IEEE Access, (2020)Finding the Anticover of a String., , , , , , и . CPM, том 161 из LIPIcs, стр. 2:1-2:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)A meta-algorithm for finding large k-plexes., , , и . Knowl. Inf. Syst., 63 (7): 1745-1769 (2021)Listing Maximal Subgraphs in Strongly Accessible Set Systems., , , и . CoRR, (2018)CAGE: Cache-Aware Graphlet Enumeration., , и . SPIRE, том 14240 из Lecture Notes in Computer Science, стр. 129-142. Springer, (2023)Listing Subgraphs by Cartesian Decomposition., , , , и . MFCS, том 117 из LIPIcs, стр. 84:1-84:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Directing Road Networks by Listing Strong Orientations., , , , и . IWOCA, том 9843 из Lecture Notes in Computer Science, стр. 83-95. Springer, (2016)Node Similarity with q -Grams for Real-World Labeled Networks., , , , , и . KDD, стр. 1282-1291. ACM, (2018)Clique covering of large real-world networks., , и . SAC, стр. 1134-1139. ACM, (2016)