Finding \(k\) partially disjoint paths in a directed planar graph (Q3295274)
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 7218911
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding \(k\) partially disjoint paths in a directed planar graph |
scientific article; zbMATH DE number 7218911 |
Statements
Finding k Partially Disjoint Paths in a Directed Planar Graph (English)
0 references
8 July 2020
0 references
disjoint paths
0 references
partially disjoint paths
0 references
directed graph
0 references
planar graph
0 references
free partially commutative group
0 references
graph group
0 references
0.9064462184906006
0 references
0.905686616897583
0 references
0.8655773401260376
0 references
0.8650369644165039
0 references
