Detecting disjoint shortest paths in linear time and more (Q6875202)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8144471
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Detecting disjoint shortest paths in linear time and more |
scientific article; zbMATH DE number 8144471 |
Statements
Detecting disjoint shortest paths in linear time and more (English)
0 references
14 January 2026
0 references
disjoint shortest paths
0 references
algebraic graph algorithms
0 references
disjoint paths
0 references
fine-grained complexity
0 references
clique
0 references
0 references
