{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T04:54:49Z","timestamp":1790484889441,"version":"4.1.0"},"reference-count":25,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T00:00:00Z","timestamp":1578355200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/P025072\/1"],"award-info":[{"award-number":["EP\/P025072\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>We present a new computing package Flagser, designed to construct the directed flag complex of a finite directed graph, and compute persistent homology for flexibly defined filtrations on the graph and the resulting complex. The persistent homology computation part of Flagser is based on the program Ripser by U. Bauer, but is optimised specifically for large computations. The construction of the directed flag complex is done in a way that allows easy parallelisation by arbitrarily many cores. Flagser also has the option of working with undirected graphs. For homology computations Flagser has an approximate option, which shortens compute time with remarkable accuracy. We demonstrate the power of Flagser by applying it to the construction of the directed flag complex of digital reconstructions of brain microcircuitry by the Blue Brain Project and several other examples. In some instances we perform computation of homology. For a more complete performance analysis, we also apply Flagser to some other data collections. In all cases the hardware used in the computation, the use of memory and the compute time are recorded.<\/jats:p>","DOI":"10.3390\/a13010019","type":"journal-article","created":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T03:59:57Z","timestamp":1578455997000},"page":"19","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":44,"title":["Computing Persistent Homology of Directed Flag Complexes"],"prefix":"10.3390","volume":"13","author":[{"given":"Daniel","family":"L\u00fctgehetmann","sequence":"first","affiliation":[{"name":"Institute of Mathematics, University of Aberdeen, Aberdeen AB24 3FX, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dejan","family":"Govc","sequence":"additional","affiliation":[{"name":"Institute of Mathematics, University of Aberdeen, Aberdeen AB24 3FX, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4209-1604","authenticated-orcid":false,"given":"Jason P.","family":"Smith","sequence":"additional","affiliation":[{"name":"Institute of Mathematics, University of Aberdeen, Aberdeen AB24 3FX, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ran","family":"Levi","sequence":"additional","affiliation":[{"name":"Institute of Mathematics, University of Aberdeen, Aberdeen AB24 3FX, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2020,1,7]]},"reference":[{"key":"ref_1","unstructured":"Blue Brain Project (2019, July 02). Blue Brain Project, General Website. Available online: https:\/\/www.epfl.ch\/research\/domains\/bluebrain."},{"key":"ref_2","unstructured":"(2019, July 02). Laboratory for Topology and Neuroscience. Available online: https:\/\/hessbellwald-lab.epfl.ch\/."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Maria, C., Boissonnat, J.D., Glisse, M., and Yvinec, M. (2014). The Gudhi Library: Simplicial Complexes and Persistent Homology, INRIA. Research Report RR-8548.","DOI":"10.1007\/978-3-662-44199-2_28"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.jsc.2016.03.008","article-title":"Phat\u2014Persistent Homology Algorithms Toolbox","volume":"78","author":"Bauer","year":"2017","journal-title":"J. Symb. Comput."},{"key":"ref_5","unstructured":"Blue Brain Project (2019, July 02). Digital Reconstruction of Neocortical Microcircuitry. Available online: https:\/\/bbp.epfl.ch\/nmc-portal\/downloads."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"48","DOI":"10.3389\/fncom.2017.00048","article-title":"Cliques of Neurons Bound into Cavities Provide a Missing Link between Structure and Function","volume":"11","author":"Reimann","year":"2017","journal-title":"Front. Comput. Neurosci."},{"key":"ref_7","unstructured":"D\u0142otko, P. (2019, July 02). Topological Neuroscience Software. Available online: http:\/\/neurotop.gforge.inria.fr."},{"key":"ref_8","unstructured":"Blue Brain Project (2019, July 02). Mouse Whole-Neocortex Connectome Model. Available online: https:\/\/portal.bluebrain.epfl.ch\/resources\/models\/mouse-projections\/."},{"key":"ref_9","unstructured":"Smith, J.P. (2019, July 02). Flagser-Adaptions. Available online: https:\/\/github.com\/JasonPSmith\/flagser-adaptions."},{"key":"ref_10","unstructured":"Bauer, U. (2018, August 29). Ripser: A Lean C++ Code for the Computation of Vietoris-Rips Persistence Barcodes. 2015\u20132018. Available online: http:\/\/ripser.org."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Kunegis, J. (2013, January 13\u201317). KONECT\u2014The Koblenz Network Collection. Proceedings of the 22nd International Conference on World Wide Web Companion, Rio de Janeiro, Brazil.","DOI":"10.1145\/2487788.2488173"},{"key":"ref_12","unstructured":"Kunegis, J. (2019, July 02). KONECT\u2014The Koblenz Network Collection Website. Available online: http:\/\/konect.uni-koblenz.de\/."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Varshney, L.R., Chen, B.L., Paniagua, E., Hall, D.H., and Chklovskii, D.B. (2011). Structural Properties of the Caenorhabditis elegans Neuronal Network. PLoS Comput. Biol., 7.","DOI":"10.1371\/journal.pcbi.1001066"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1016\/j.topol.2013.03.009","article-title":"Special cycles in independence complexes and superfrustration in some lattices","volume":"160","author":"Adamaszek","year":"2013","journal-title":"Topol. Appl."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/j.cag.2010.03.007","article-title":"Fast construction of the Vietoris-Rips complex","volume":"34","author":"Zomorodian","year":"2010","journal-title":"Comput. Graph."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.entcs.2014.06.011","article-title":"jHoles: A Tool for Understanding Biological Complex Networks via Clique Weight Rank Persistent Homology","volume":"306","author":"Binchi","year":"2014","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"ref_17","unstructured":"L\u00fctgehetmann, D. (2019, July 02). Computing Homology of Directed Flag Complexes. Available online: https:\/\/github.com\/luetge\/flagser."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1142\/S179352531650014X","article-title":"Large random simplicial complexes, I","volume":"8","author":"Costa","year":"2016","journal-title":"J. Topol. Anal."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"2229","DOI":"10.1109\/TPWRS.2014.2306756","article-title":"Hierarchical spectral clustering of power grids","volume":"29","author":"Fennelly","year":"2014","journal-title":"IEEE Trans. Power Syst."},{"key":"ref_20","unstructured":"Munkres, J.R. (1984). Elements of Algebraic Topology, Addison-Wesley."},{"key":"ref_21","unstructured":"Hatcher, A. (2002). Algebraic Topology, Cambridge University Press."},{"key":"ref_22","first-page":"257","article-title":"Persistent homology\u2014A survey","volume":"Volume 453","author":"Edelsbrunner","year":"2008","journal-title":"Surveys on Discrete and Computational Geometry"},{"key":"ref_23","unstructured":"Bauer, U. (2018, August 29). Ripser: Efficient Computation of Vietoris-Rips Persistence Barcodes. Available online: http:\/\/ulrich-bauer.org\/ripser-talk.pdf."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/0602010","article-title":"Computing the Minimum Fill-In is NP-Complete","volume":"2","author":"Yannakakis","year":"1981","journal-title":"SIAM J. Algebraic Discret. Methods"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1006\/aima.1997.1650","article-title":"Morse Theory for Cell Complexes","volume":"134","author":"Forman","year":"1998","journal-title":"Adv. Math."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/1\/19\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T14:04:13Z","timestamp":1760364253000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/1\/19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,7]]},"references-count":25,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2020,1]]}},"alternative-id":["a13010019"],"URL":"https:\/\/doi.org\/10.3390\/a13010019","relation":{"has-preprint":[{"id-type":"doi","id":"10.20944\/preprints201911.0366.v1","asserted-by":"object"}]},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,7]]}}}