Pages that link to "Item:Q1351463"
From MaRDI portal
The following pages link to On the computational complexity of dynamic graph problems (Q1351463):
Displaying 26 items.
- Incremental problems in the parameterized complexity setting (Q519883) (← links)
- Two-level heaps: a new priority queue structure with applications to the single source shortest path problem (Q607658) (← links)
- Average update times for fully-dynamic all-pairs shortest paths (Q643013) (← links)
- A formal verification technique for behavioural model-to-model transformations (Q682361) (← links)
- Lifelong planning \(\text{A}^*\) (Q814587) (← links)
- Maintaining longest paths incrementally (Q816679) (← links)
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures (Q849628) (← links)
- Average-case analysis of incremental topological ordering (Q968137) (← links)
- On competitive on-line algorithms for the dynamic priority-ordering problem (Q1332747) (← links)
- On the computational complexity of dynamic graph problems (Q1351463) (← links)
- A fully dynamic algorithm for distributed shortest paths. (Q1401293) (← links)
- Semi-dynamic breadth-first search in digraphs (Q1589436) (← links)
- Optimization of spatial complex networks (Q1620251) (← links)
- Tiers for peers: a practical algorithm for discovering hierarchy in weighted networks (Q1741316) (← links)
- Partially dynamic efficient algorithms for distributed shortest paths (Q2268860) (← links)
- Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class (Q2457656) (← links)
- Fully dynamic all pairs shortest paths with real edge weights (Q2496318) (← links)
- Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates (Q2828206) (← links)
- Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks (Q2864176) (← links)
- Dynamically Maintaining Shortest Path Trees under Batches of Updates (Q2868652) (← links)
- On the complexity of average path length for biological networks and patterns (Q2922126) (← links)
- A dynamic topological sort algorithm for directed acyclic graphs (Q3507767) (← links)
- Improving the Betweenness Centrality of a Node by Adding Links (Q4555544) (← links)
- Certified Graph View Maintenance with Regular Datalog (Q4559800) (← links)
- A single-source shortest path algorithm for dynamic graphs (Q4956230) (← links)
- Average-Case Analysis of Online Topological Ordering (Q5387779) (← links)
