From post

Why did the shape of your network change? (On detecting network anomalies via non-local curvatures)

, , и . (2018)cite arxiv:1808.05676Comment: Final revised version; to appear in Algorithmica.

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.

 

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

On the complexity and approximation of syntenic distance., , , , и . RECOMB, стр. 99-108. ACM, (1997)A comparative study of Dirichlet and Neumann conditions for path planning through harmonic functions., , и . Future Gener. Comput. Syst., 20 (3): 441-452 (2004)Sample complexity for learning recurrent perceptron mappings., и . IEEE Trans. Inf. Theory, 42 (5): 1479-1487 (1996)Algorithmic and complexity results for decompositions of biological networks into monotone subsystems., , , и . Biosyst., 90 (1): 161-178 (2007)On the Computational Complexity of Measuring Global Stability of Banking Networks., , , и . Algorithmica, 70 (4): 595-647 (2014)Nearest Neighbor Interchange and Related Distances., , , , и . Encyclopedia of Algorithms, (2016)Effect of Gromov-Hyperbolicity Parameter on Cuts and Expansions in Graphs and Some Algorithmic Implications., , , и . Algorithmica, 80 (2): 772-800 (2018)On analyzing and evaluating privacy measures for social networks under active attack., , и . CoRR, (2018)On global stability of financial networks., и . J. Complex Networks, 2 (3): 313-354 (2014)On a connection between small set expansions and modularity clustering., и . Inf. Process. Lett., 114 (7): 349-352 (2014)