Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. |
scientific article; zbMATH DE number 7651170
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. |
scientific article; zbMATH DE number 7651170 |
Statements
7 February 2023
0 references
dynamic graph algorithms
0 references
planar graphs
0 references
single-source shortest paths
0 references
strong connectivity
0 references
Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
