1 paper
Hartmut H K Lentz, Thomas Selhorst, Igor M Sokolov
An accessibility graph of a network contains a link, wherever there is a path of arbitrary length between two nodes. We generalize the concept of accessibility to temporal networks…