Computing vertex-disjoint paths in large graphs using MAOs (Q5091003)
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 7561367
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing vertex-disjoint paths in large graphs using MAOs |
scientific article; zbMATH DE number 7561367 |
Statements
21 July 2022
0 references
computing disjoint paths
0 references
large graphs
0 references
vertex-connectivity
0 references
linear-time
0 references
maximal adjacency ordering
0 references
maximum cardinality search
0 references
big data
0 references
certifying
0 references
0 references
0.998794674873352
0 references
0.7610813975334167
0 references
