Computing vertex-disjoint paths in large graphs using MAOs (Q2285055)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing vertex-disjoint paths in large graphs using MAOs |
scientific article |
Statements
Computing vertex-disjoint paths in large graphs using MAOs (English)
0 references
16 January 2020
0 references
computing disjoint paths
0 references
large graphs
0 references
vertex-connectivity
0 references
linear-time algorithms
0 references
maximal adjacency ordering
0 references
maximum cardinality search
0 references
big data
0 references
certifying algorithms
0 references
0 references
