Dynamic graph models
From MaRDI portal
Publication:1368531
DOI10.1016/S0895-7177(97)00050-2zbMath0879.68085OpenAlexW2045319200MaRDI QIDQ1368531
Publication date: 28 September 1997
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0895-7177(97)00050-2
Related Items (15)
Dynamic-model-based switched proportional-integral state observer design and traffic density estimation for urban freeway ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective ⋮ Distributed exploration of dynamic rings ⋮ Graph signal processing on dynamic graphs based on temporal-attention product ⋮ Topological analysis of temporal hypergraphs ⋮ Cops \& robber on periodic temporal graphs: characterization and improved bounds ⋮ Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks ⋮ On the impact of link faults on Byzantine agreement ⋮ Exploration of dynamic networks: tight bounds on the number of agents ⋮ Expected maximum of bridge random walks & Lévy flights ⋮ Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks ⋮ A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective* ⋮ Universal Logic as a Science of Patterns ⋮ On the expressivity of time-varying graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantifying fault recovery in multiprocessor systems
- Parallel concepts in graph theory
- On the notion of balance of a signed graph
- Maximal Flow Through a Network
- Conditional connectivity
- A Graph Model for Fault-Tolerant Computing Systems
- The Semantics of Predicate Logic as a Programming Language
- Communicating sequential processes
- Edge fault tolerance in graphs
- The Dynamics of Brand Loyalty: A Markovian Approach
This page was built for publication: Dynamic graph models
