Pages that link to "Item:Q5856438"
From MaRDI portal
The following pages link to An Introduction to Temporal Graphs: An Algorithmic Perspective<sup>*</sup> (Q5856438):
Displaying 11 items.
- Small Point-Sets Supporting Graph Stories (Q6141788) (← links)
- Computing maximum matchings in temporal graphs (Q6168321) (← links)
- Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks (Q6179710) (← links)
- EVENT GRAPHS: ADVANCES AND APPLICATIONS OF SECOND-ORDER TIME-UNFOLDED TEMPORAL NETWORK MODELS (Q6203312) (← links)
- Models of smoothing in dynamic networks (Q6535035) (← links)
- On computing large temporal (unilateral) connected components (Q6564621) (← links)
- Nash equilibria in reverse temporal Voronoi games (Q6616234) (← links)
- The complexity of growing a graph (Q6627045) (← links)
- Cluster editing for multi-layer and temporal graphs (Q6635696) (← links)
- On computing optimal temporal branchings and spanning subgraphs (Q6655668) (← links)
- Payment scheduling in the interval debt model (Q6664057) (← links)