{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:28:02Z","timestamp":1778495282759,"version":"3.51.4"},"reference-count":76,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2020,1,22]],"date-time":"2020-01-22T00:00:00Z","timestamp":1579651200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,22]],"date-time":"2020-01-22T00:00:00Z","timestamp":1579651200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["1160995"],"award-info":[{"award-number":["1160995"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["1814931"],"award-info":[{"award-number":["1814931"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s00453-019-00665-7","type":"journal-article","created":{"date-parts":[[2020,1,22]],"date-time":"2020-01-22T07:02:50Z","timestamp":1579676570000},"page":"1741-1783","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Why Did the Shape of Your Network Change? (On Detecting Network Anomalies via Non-local Curvatures)"],"prefix":"10.1007","volume":"82","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5614-5477","authenticated-orcid":false,"given":"Bhaskar","family":"DasGupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mano Vikash","family":"Janardhanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farzane","family":"Yahyanejad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,22]]},"reference":[{"issue":"1","key":"665_CR1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.-L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47\u201397 (2002)","journal-title":"Rev. Mod. Phys."},{"issue":"3","key":"665_CR2","doi-asserted-by":"crossref","first-page":"032811","DOI":"10.1103\/PhysRevE.89.032811","volume":"89","author":"R Albert","year":"2014","unstructured":"Albert, R., DasGupta, B., Mobasheri, N.: Topological implications of negative curvature for biological and social networks. Phys. Rev. E 89(3), 032811 (2014)","journal-title":"Phys. Rev. E"},{"issue":"2","key":"665_CR3","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s00453-007-9055-0","volume":"51","author":"R Albert","year":"2008","unstructured":"Albert, R., DasGupta, B., Dondi, R., Sontag, E.: Inferring (biological) signal transduction networks via transitive reductions of directed graphs. Algorithmica 51(2), 129\u2013159 (2008)","journal-title":"Algorithmica"},{"issue":"7","key":"665_CR4","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1089\/cmb.2007.0015","volume":"14","author":"R Albert","year":"2007","unstructured":"Albert, R., DasGupta, B., Dondi, R., Kachalo, S., Sontag, E., Zelikovsky, A., Westbrooks, K.: A novel method for signal transduction network inference from indirect experimental evidence. J. Comput. Biol. 14(7), 927\u2013949 (2007)","journal-title":"J. Comput. Biol."},{"issue":"3","key":"665_CR5","doi-asserted-by":"crossref","first-page":"036117","DOI":"10.1103\/PhysRevE.84.036117","volume":"84","author":"R Albert","year":"2011","unstructured":"Albert, R., DasGupta, B., Gitter, A., G\u00fcrsoy, G., Hegde, R., Pal, P., Sivanathan, G.S., Sontag, E.D.: A new computationally efficient measure of topological redundancy of biological and social networks. Phys. Rev. E 84(3), 036117 (2011)","journal-title":"Phys. Rev. E"},{"issue":"49","key":"665_CR6","doi-asserted-by":"crossref","first-page":"17559","DOI":"10.1073\/pnas.0509033102","volume":"102","author":"O Alter","year":"2005","unstructured":"Alter, O., Golub, G.H.: Reconstructing the pathways of a cellular system from genome-scale signals by using matrix and tensor computations. PNAS 102(49), 17559\u201317564 (2005)","journal-title":"PNAS"},{"issue":"2","key":"665_CR7","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/s10115-016-0987-z","volume":"51","author":"S Aminikhanghahi","year":"2017","unstructured":"Aminikhanghahi, S., Cook, D.J.: A survey of methods for time series change point detection. Knowl. Inf. Syst. 51(2), 339\u2013367 (2017)","journal-title":"Knowl. Inf. Syst."},{"key":"665_CR8","doi-asserted-by":"crossref","unstructured":"Ariaei, F., Lou, M., Jonckeere, E., Krishnamachari, B., Zuniga, M.: Curvature of sensor network: clustering coefficient. EURASIP J. Wirel. Commun. Netw. 213185 (2008)","DOI":"10.1155\/2008\/213185"},{"issue":"18","key":"665_CR9","doi-asserted-by":"crossref","first-page":"7641","DOI":"10.1073\/pnas.1018985108","volume":"108","author":"DS Bassett","year":"2011","unstructured":"Bassett, D.S., Wymbs, N.F., Porter, M.A., Mucha, P.J., Carlson, J.M., Grafton, S.T.: Dynamic reconfiguration of human brain networks during learning. PNAS 108(18), 7641\u20137646 (2011)","journal-title":"PNAS"},{"key":"665_CR10","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF02783040","volume":"108","author":"I Benjamini","year":"1998","unstructured":"Benjamini, I.: Expanders are not hyperbolic. Israel J. Math. 108, 33\u201336 (1998)","journal-title":"Israel J. Math."},{"key":"665_CR11","volume-title":"A Panoramic View of Riemannian Geometry","author":"M Berger","year":"2012","unstructured":"Berger, M.: A Panoramic View of Riemannian Geometry. Springer, Berlin (2012)"},{"key":"665_CR12","unstructured":"Bloch, E.: Combinatorial Ricci curvature for polyhedral surfaces and posets. Preprint, arXiv:1406.4598v1 [math.CO] (2014)"},{"issue":"2","key":"665_CR13","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1016\/S1053-8119(03)00406-3","volume":"20","author":"M Bosc","year":"2003","unstructured":"Bosc, M., Heitz, F., Armspach, J.P., Namer, I., Gounot, D., Rumbach, L.: Automatic change detection in multimodal serial MRI: application to multiple sclerosis lesion evolution. Neuroimage 20(2), 643\u2013656 (2003)","journal-title":"Neuroimage"},{"key":"665_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-12494-9","volume-title":"Metric Spaces of Non-positive Curvature","author":"MR Bridson","year":"1999","unstructured":"Bridson, M.R., Haefliger, A.: Metric Spaces of Non-positive Curvature. Springer, Berlin (1999)"},{"key":"665_CR15","unstructured":"Chalopin, J., Chepoi, V., Dragan, F.F., Ducoffe, G., Mohammed, A., Vax\u00e8s, Y.: Fast approximation and exact computation of negative curvature parameters of graphs. Discrete Comput. Geom. (to appear)"},{"key":"665_CR16","doi-asserted-by":"crossref","unstructured":"Chepoi, V., Dragan, F. F., Estellon, B., Habib, M., Vax\u00e8s, Y.: Diameters, centers, and approximating trees of $$\\delta $$-hyperbolic geodesic spaces and graphs. In: Proceedings of the 24th Annual Symposium on Computational geometry, pp. 59\u201368 (2008)","DOI":"10.1145\/1377676.1377687"},{"issue":"3\u20134","key":"665_CR17","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1007\/s00453-010-9478-x","volume":"62","author":"V Chepoi","year":"2012","unstructured":"Chepoi, V., Dragan, F.F., Estellon, B., Habib, M., Vax\u00e8s, Y., Xiang, Y.: Additive spanners and distance and routing labeling schemes for $$\\delta $$-hyperbolic graphs. Algorithmica 62(3\u20134), 713\u2013732 (2012)","journal-title":"Algorithmica"},{"key":"665_CR18","first-page":"59","volume-title":"Lecture Notes in Computer Science 4627","author":"V Chepoi","year":"2007","unstructured":"Chepoi, V., Estellon, B.: Packing and covering $$\\delta $$-hyperbolic spaces by balls. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) Lecture Notes in Computer Science 4627, pp. 59\u201373. Springer, Berlin (2007)"},{"key":"665_CR19","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/j.tcs.2005.11.029","volume":"354","author":"M Chleb\u00edk","year":"2006","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Complexity of approximating bounded variants of optimization problems. Theor. Comput. Sci. 354, 320\u2013338 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"665_CR20","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10772-011-9116-2","volume":"15","author":"MFR Chowdhury","year":"2011","unstructured":"Chowdhury, M.F.R., Selouani, S.A., O\u2019Shaughnessy, D.: Bayesian on-line spectral change point detection: a soft computing approach for on-line ASR. Int. J. Speech Technol. 15(1), 5\u201323 (2011)","journal-title":"Int. J. Speech Technol."},{"key":"665_CR21","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1038\/nphys209","volume":"2","author":"V Colizza","year":"2006","unstructured":"Colizza, V., Flammini, A., Serrano, M.A., Vespignani, A.: Detecting rich-club ordering in complex networks. Nat. Phys. 2, 110\u2013115 (2006)","journal-title":"Nat. Phys."},{"key":"665_CR22","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033142","volume-title":"Combinatorial Optimization","author":"WJ Cook","year":"1997","unstructured":"Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial Optimization. Wiley, New York (1997)"},{"key":"665_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Berlin (2015)"},{"key":"665_CR24","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.jcss.2012.04.003","volume":"79","author":"B DasGupta","year":"2013","unstructured":"DasGupta, B., Desai, D.: Complexity of Newman\u2019s community finding approach for social networks. J. Comput. Syst. Sci. 79, 50\u201367 (2013)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"665_CR25","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1007\/s00453-017-0291-7","volume":"80","author":"B DasGupta","year":"2018","unstructured":"DasGupta, B., Karpinski, M., Mobasheri, N., Yahyanejad, F.: Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications. Algorithmica 80(2), 772\u2013800 (2018)","journal-title":"Algorithmica"},{"key":"665_CR26","doi-asserted-by":"crossref","DOI":"10.1002\/9781119162254","volume-title":"Models and Algorithms for Biomolecules and Molecular Networks","author":"B DasGupta","year":"2016","unstructured":"DasGupta, B., Liang, J.: Models and Algorithms for Biomolecules and Molecular Networks. Wiley, New York (2016)"},{"key":"665_CR27","doi-asserted-by":"crossref","unstructured":"Duan, R.: Approximation algorithms for the Gromov hyperbolicity of discrete metric spaces. In: Pardo, A., Viola, A. (eds.) LATIN 2014, LNCS 8392, pp. 285\u2013293 (2014)","DOI":"10.1007\/978-3-642-54423-1_25"},{"key":"665_CR28","doi-asserted-by":"crossref","unstructured":"de Montgolfier, F., Soto, M., Viennot, L.: Treewidth and hyperbolicity of the internet. In: Proceedings of the 10th IEEE International Symposium on Networking Computing and Applications, pp. 25\u201332 (2011)","DOI":"10.1109\/NCA.2011.11"},{"issue":"1","key":"665_CR29","doi-asserted-by":"crossref","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I Dinur","year":"2005","unstructured":"Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Ann. Math. 162(1), 439\u2013485 (2005)","journal-title":"Ann. Math."},{"issue":"9","key":"665_CR30","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1002\/joc.924","volume":"23","author":"JF Ducre-Robitaille","year":"2003","unstructured":"Ducre-Robitaille, J.F., Vincent, L.A., Boulet, G.: Comparison of techniques for detection of discontinuities in temperature series. Int. J. Climatol. 23(9), 1087\u20131101 (2003)","journal-title":"Int. J. Climatol."},{"key":"665_CR31","unstructured":"Feige, U., Seltser, M.: On the densest k-subgraph problems, Technical Report # CS97-16, Faculty of Mathematics and Computer Science, Weizmann Institute of Science, Israel. https:\/\/pdfs.semanticscholar.org\/eb26\/c37ff9da661fdc55a0cb8d31ab323e901b3b.pdf"},{"issue":"3","key":"665_CR32","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s00454-002-0743-x","volume":"29","author":"R Forman","year":"2003","unstructured":"Forman, R.: Bochner\u2019s method for cell complexes and combinatorial Ricci curvature. Discrete Comput. Geom. 29(3), 323\u2013374 (2003)","journal-title":"Discrete Comput. Geom."},{"issue":"6\u20138","key":"665_CR33","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1016\/j.ipl.2015.02.002","volume":"115","author":"H Fournier","year":"2015","unstructured":"Fournier, H., Ismail, A., Vigneron, A.: Computing the Gromov hyperbolicity of a discrete metric space. Inf. Process. Lett. 115(6\u20138), 576\u2013579 (2015)","journal-title":"Inf. Process. Lett."},{"key":"665_CR34","volume-title":"Introduction to Topology","author":"TW Gamelin","year":"1999","unstructured":"Gamelin, T.W., Greene, R.E.: Introduction to Topology. Dover Publications, Mineola (1999)"},{"key":"665_CR35","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979)"},{"key":"665_CR36","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar Hamiltonian circuit problem is $${\\sf NP}$$-complete. SIAM J. Comput. 5, 704\u2013714 (1976)","journal-title":"SIAM J. Comput."},{"key":"665_CR37","first-page":"1071","volume-title":"Lecture Notes in Computer Science 3827","author":"C Gavoille","year":"2005","unstructured":"Gavoille, C., Ly, O.: Distance Labeling in Hyperbolic Graphs. In: Deng, X., Du, D.-Z. (eds.) Lecture Notes in Computer Science 3827, pp. 1071\u20131079. Springer, Berlin (2005)"},{"key":"665_CR38","unstructured":"Goldberg, A.V.: Finding a maximum density subgraph. Technical report (1984)"},{"key":"665_CR39","doi-asserted-by":"crossref","unstructured":"Gromov, M.: Hyperbolic groups. In: Essays in Group Theory, vol. 8, pp. 75\u2013263 (1987)","DOI":"10.1007\/978-1-4613-9586-7_3"},{"key":"665_CR40","doi-asserted-by":"crossref","DOI":"10.1515\/9781400834747","volume-title":"The Nature of Space and Time","author":"S Hawking","year":"1996","unstructured":"Hawking, S., Penrose, R.: The Nature of Space and Time. Princeton University Press, Cambridge (1996)"},{"key":"665_CR41","volume-title":"A Combinatorial Introduction to Topology","author":"M Henle","year":"1994","unstructured":"Henle, M.: A Combinatorial Introduction to Topology. Dover Publications, San Francisco (1994)"},{"key":"665_CR42","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of $$k$$-Sat. J. Comput. Syst. Sci. 62, 367\u2013375 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"665_CR43","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"665_CR44","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1016\/j.aam.2006.08.004","volume":"39","author":"AS Jarrah","year":"2007","unstructured":"Jarrah, A.S., Laubenbacher, R., Stigler, B., Stillman, M.: Reverse-engineering polynomial dynamical systems. Adv. App. Math. 39(4), 477\u2013489 (2007)","journal-title":"Adv. App. Math."},{"key":"665_CR45","doi-asserted-by":"crossref","unstructured":"Jonckheere, E.A., Lohsoonthorn, P.: Geometry of network security. In: American Control Conference, vol. 2, pp. 976\u2013981 (2004)","DOI":"10.23919\/ACC.2004.1386698"},{"issue":"3","key":"665_CR46","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1080\/15427951.2011.601233","volume":"7","author":"E Jonckheere","year":"2011","unstructured":"Jonckheere, E., Lohsoonthorn, P., Ariaei, F.: Scaled Gromov four-point condition for network graph curvature computation. Internet Math. 7(3), 137\u2013177 (2011)","journal-title":"Internet Math."},{"issue":"2","key":"665_CR47","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1002\/jgt.20275","volume":"57","author":"E Jonckheere","year":"2007","unstructured":"Jonckheere, E., Lohsoonthorn, P., Bonahon, F.: Scaled Gromov hyperbolic graphs. J. Graph Theory 57(2), 157\u2013180 (2007)","journal-title":"J. Graph Theory"},{"issue":"1","key":"665_CR48","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/15427951.2010.554320","volume":"7","author":"E Jonckheerea","year":"2011","unstructured":"Jonckheerea, E., Loua, M., Bonahona, F., Baryshnikova, Y.: Euclidean versus hyperbolic congestion in idealized versus experimental networks. Internet Math. 7(1), 1\u201327 (2011)","journal-title":"Internet Math."},{"key":"665_CR49","doi-asserted-by":"crossref","unstructured":"Kawahara, Y., Sugiyama, M.: Sequential change-point detection based on direct density-ratio estimation, pp. 389\u2013400(2009)","DOI":"10.1137\/1.9781611972795.34"},{"key":"665_CR50","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the power of unique 2-Prover 1-Round games. In: 34th ACM Symposium on Theory of Computing, pp. 767\u2013775 (2002)","DOI":"10.1145\/509907.510017"},{"issue":"3","key":"665_CR51","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S Khot","year":"2008","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2-$$\\varepsilon $$. J. Comput. Syst. Sci. 74(3), 335\u2013349 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"665_CR52","volume-title":"Fundamentals of Human Neuropsychology","author":"B Kolb","year":"1996","unstructured":"Kolb, B., Whishaw, I.Q.: Fundamentals of Human Neuropsychology. Freeman, New York (1996)"},{"key":"665_CR53","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1088\/1367-2630\/9\/6\/188","volume":"9","author":"V Latora","year":"2007","unstructured":"Latora, V., Marchior, M.: A measure of centrality based on network efficiency. New J. Phys. 9, 188 (2007)","journal-title":"New J. Phys."},{"key":"665_CR54","doi-asserted-by":"crossref","first-page":"066108","DOI":"10.1103\/PhysRevE.84.066108","volume":"84","author":"D Narayan","year":"2011","unstructured":"Narayan, D., Saniee, I.: Large-scale curvature of networks. Phys. Rev. E 84, 066108 (2011)","journal-title":"Phys. Rev. E"},{"key":"665_CR55","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"MEJ Newman","year":"2010","unstructured":"Newman, M.E.J.: Networks: An Introduction. Oxford University Press, Oxford (2010)"},{"issue":"47","key":"665_CR56","doi-asserted-by":"crossref","first-page":"18371","DOI":"10.1073\/pnas.0709146104","volume":"104","author":"L Omberg","year":"2007","unstructured":"Omberg, L., Golub, G.H., Alter, O.: A tensor higher-order singular value decomposition for integrative analysis of DNA microarray data from different studies. PNAS 104(47), 18371\u201318376 (2007)","journal-title":"PNAS"},{"key":"665_CR57","doi-asserted-by":"crossref","unstructured":"Papadopoulos, F., Krioukov, D., Boguna, M., Vahdat, A.: Greedy forwarding in dynamic scale-free networks embedded in hyperbolic metric spaces. In: IEEE Conference on Computer Communications, pp. 1\u20139 (2010)","DOI":"10.1109\/INFCOM.2010.5462131"},{"issue":"6","key":"665_CR58","doi-asserted-by":"crossref","first-page":"900","DOI":"10.1175\/JAM2493.1","volume":"46","author":"J Reeves","year":"2007","unstructured":"Reeves, J., Chen, J., Wang, X.L., Lund, R., Lu, Q.Q.: A review and comparison of changepoint detection techniques for climate data. J. Appl. Meteorol. Climatol. 46(6), 900\u2013915 (2007)","journal-title":"J. Appl. Meteorol. Climatol."},{"key":"665_CR59","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:AMHU.0000028240.16521.9d","volume":"103","author":"JM Rodr\u00edguez","year":"2004","unstructured":"Rodr\u00edguez, J.M., Tour\u00eds, E.: Gromov hyperbolicity through decomposition of metric spaces. Acta Math. Hungar. 103, 53\u201384 (2004)","journal-title":"Acta Math. Hungar."},{"key":"665_CR60","volume-title":"Index Theory, Coarse Geometry, and Topology of Manifolds, Conference Board of the Mathematical Sciences Regional Conference, Series 90","author":"J Roe","year":"1996","unstructured":"Roe, J.: Index Theory, Coarse Geometry, and Topology of Manifolds, Conference Board of the Mathematical Sciences Regional Conference, Series 90. American Mathematical Society, Providence (1996)"},{"key":"665_CR61","doi-asserted-by":"crossref","unstructured":"Rybach, D., Gollan, C., Schluter, R., Ney, H.: Audio segmentation for speech recognition using segment features. In: IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 4197\u20134200 (2009)","DOI":"10.1109\/ICASSP.2009.4960554"},{"key":"665_CR62","doi-asserted-by":"crossref","first-page":"e1002267","DOI":"10.1371\/journal.pcbi.1002267","volume":"7","author":"A Saadatpour","year":"2011","unstructured":"Saadatpour, A., Wang, R.S., Liao, A., Liu, X., Loughran, T.P., Albert, I., Albert, R.: Dynamical and structural analysis of a T cell survival network identifies novel candidate therapeutic targets for large granular lymphocyte leukemia. PLoS Comput. Biol. 7, e1002267 (2011)","journal-title":"PLoS Comput. Biol."},{"key":"665_CR63","doi-asserted-by":"crossref","unstructured":"Samal, A., Sreejith, R.P., Gu, J., Liu, S., Saucan, E., Jost, J.: Comparative analysis of two discretizations of Ricci curvature for complex networks. Sci. Rep. 8, Article number: 8650 (2018)","DOI":"10.1038\/s41598-018-27001-3"},{"key":"665_CR64","doi-asserted-by":"crossref","unstructured":"Sun, J., Tao, D., Faloutsos, C.: Beyond streams and graphs: dynamic tensor analysis. In: 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 374\u2013383 (2006)","DOI":"10.1145\/1150402.1150445"},{"key":"665_CR65","doi-asserted-by":"crossref","first-page":"3257","DOI":"10.1073\/pnas.96.6.3257","volume":"96","author":"G Tononi","year":"1999","unstructured":"Tononi, G., Sporns, O., Edelman, G.M.: Measures of degeneracy and redundancy in biological networks. PNAS 96, 3257\u20133262 (1999)","journal-title":"PNAS"},{"issue":"1","key":"665_CR66","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1090\/S0273-0979-2011-01361-1","volume":"49","author":"L Trevisan","year":"2012","unstructured":"Trevisan, L.: On Khot\u2019s unique games conjecture. Bull. Am. Math. Soc. 49(1), 91\u2013111 (2012)","journal-title":"Bull. Am. Math. Soc."},{"key":"665_CR67","volume-title":"Approximation Algorithms","author":"V Vazirani","year":"2001","unstructured":"Vazirani, V.: Approximation Algorithms. Springer, Berlin (2001)"},{"key":"665_CR68","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1101\/gr.193902","volume":"12","author":"A Wagner","year":"2002","unstructured":"Wagner, A.: Estimating coarse gene network structure from large-scale gene perturbation data. Genome Res. 12, 309\u2013315 (2002)","journal-title":"Genome Res."},{"key":"665_CR69","unstructured":"Weber, M., Saucan, E., Jost J.: Can one see the shape of a network? arXiv:1608.07838v2 [math.CO] (2016)"},{"key":"665_CR70","doi-asserted-by":"crossref","unstructured":"Weber, M., Jost, J., Saucan, E.: Forman-Ricci flow for change detection in large dynamic data sets. In: International Conference on Information and Computational Science (2016)","DOI":"10.3390\/axioms5040026"},{"key":"665_CR71","doi-asserted-by":"crossref","unstructured":"Williams, V.V.: Multiplying matrices faster than Coppersmith\u2013Winograd. In: 44th ACM Symposium on Theory of Computing, pp. 887\u2013898 (2012)","DOI":"10.1145\/2213977.2214056"},{"key":"665_CR72","doi-asserted-by":"crossref","unstructured":"Woeginger, G.: Exact algorithms for NP-hard problems: a survey. In: Combinatorial Optimization\u2014Eureka, You Shrink!, vol. 2570, pp. 185\u2013207. Springer, Berlin (2003)","DOI":"10.1007\/3-540-36478-1_17"},{"key":"665_CR73","unstructured":"Yahyanejad, F., DasGupta, B., Albert, R.: A survey of some tensor analysis techniques for biological systems. Quant. Biol. (to appear)"},{"issue":"11","key":"665_CR74","doi-asserted-by":"crossref","first-page":"2211","DOI":"10.1109\/TBME.2006.877107","volume":"53","author":"P Yang","year":"2006","unstructured":"Yang, P., Dumont, G., Ansermino, J.M.: Adaptive change detection in heart rate trend monitoring in anesthetized children. IEEE Trans. Biomed. Eng. 53(11), 2211\u20132219 (2006)","journal-title":"IEEE Trans. Biomed. Eng."},{"key":"665_CR75","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Node- and edge-deletion NP-complete problems. In: 10th Annual ACM Symposium on Theory of Computing, pp. 253-264 (1978)","DOI":"10.1145\/800133.804355"},{"key":"665_CR76","doi-asserted-by":"crossref","first-page":"e1004193","DOI":"10.1371\/journal.pcbi.1004193","volume":"11","author":"JGT Zanudo","year":"2015","unstructured":"Zanudo, J.G.T., Albert, R.: Cell fate reprogramming by control of intracellular network dynamics. PLoS Comput. Biol. 11, e1004193 (2015)","journal-title":"PLoS Comput. Biol."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00665-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-019-00665-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00665-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,21]],"date-time":"2021-01-21T00:42:58Z","timestamp":1611189778000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-019-00665-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,22]]},"references-count":76,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["665"],"URL":"https:\/\/doi.org\/10.1007\/s00453-019-00665-7","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,22]]},"assertion":[{"value":"16 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}