A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph (Q1628689): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q129038309, #quickstatements; #temporary_batch_1727086005326 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129038309 / rank | |||
Normal rank | |||
Revision as of 11:07, 23 September 2024
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
