On persistent directed graphs
From MaRDI portal
Publication:3548727
DOI10.1002/NET.20248zbMATH Open1157.68052OpenAlexW4240845184MaRDI QIDQ3548727FDOQ3548727
Authors: Jørgen Bang-Jensen, Tibor Jordán
Publication date: 17 December 2008
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20248
Recommendations
- Persistent path homology of directed networks
- Topological graph persistence
- Persistent homology over directed acyclic graphs
- On permanent graphs
- A study of connectivity on dynamic graphs: computing persistent connected components
- Persistent graphs and cyclic polytope triangulations
- Dynamic maintenance of directed hypergraphs
- A dynamical core for topological directed graphs
- On rooted directed path graphs
- On cycles of directed graphs
Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Connected rigidity matroids and unique realizations of graphs
- On graphs and rigidity of plane skeletal structures
- Title not available (Why is that?)
- Decomposition of Finite Graphs Into Forests
- Title not available (Why is that?)
- Directed graphs for the analysis of rigidity and persistence in autonomous agent systems
- Three and higher dimensional autonomous formations: rigidity, persistence and structural persistence
Cited In (1)
This page was built for publication: On persistent directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548727)