Counting temporal paths
From MaRDI portal
Cites work
- A faster algorithm for betweenness centrality*
- An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
- An introduction to temporal graphs: an algorithmic perspective
- Approximately counting paths and cycles in a graph
- Assigning times to minimise reachability in temporal graphs
- Balanced families of perfect hash functions and their applications
- Betweenness in time dependent networks
- Computing Betweenness Centrality in Link Streams
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- Connectivity and inference problems for temporal networks
- Counting temporal paths
- Delay-robust routes in temporal graphs
- Deleting edges to restrict the size of an epidemic in temporal networks
- Edge exploration of temporal graphs
- Feedback edge sets in temporal graphs
- Finding temporal paths under waiting time constraints
- Fundamentals of parameterized complexity
- Graph structure and monadic second-order logic. A language-theoretic approach
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- scientific article; zbMATH DE number 1979521 (Why is no real title available?)
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
- Interval scheduling and colorful independent sets
- Non-strict Temporal Exploration
- On exploring always-connected temporal graphs of small pathwidth
- On finding separators in temporal split and permutation graphs
- On temporal graph exploration
- On the enumeration of bicriteria temporal paths
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
- On the parameterized complexity of some optimization problems related to multiple-interval graphs
- On the size and the approximability of minimum temporally connected subgraphs
- Optimizing reachability sets in temporal graphs by delaying
- Parallel recognition of series-parallel graphs
- Parameterized algorithms
- Parametrized complexity theory.
- Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
- Random generation of combinatorial structures from a uniform distribution
- Sparsity. Graphs, structures, and algorithms
- Temporal cliques admit sparse spanners
- Temporal graph classes: a view through temporal separators
- Temporal network optimization subject to connectivity constraints
- Temporal network theory
- Temporal reachability minimization: delaying vs. deleting
- The complexity of computing optimum labelings for temporal connectivity
- The Complexity of Enumeration and Reliability Problems
- The complexity of finding small separators in temporal graphs
- The complexity of finding temporal separators under waiting time constraints
- The complexity of optimal design of temporally connected graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- The Parameterized Complexity of Counting Problems
- The parity of set systems under random restrictions with applications to exponential time problems
- The temporal explorer who returns to the base
- Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality
- Two moves per time step make a difference
This page was built for publication: Counting temporal paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6980432)
