A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph (Q1628689)
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: A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph |
scientific article |
Statements
A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph (English)
0 references
5 December 2018
0 references
disjoint path cover
0 references
cube of graph
0 references
graph algorithms
0 references
0 references
