On exploring always-connected temporal graphs of small pathwidth (Q1628692): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59567334, #quickstatements; #temporary_batch_1711055989931 |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1807.11869 / rank | |||
Normal rank | |||
Latest revision as of 21:04, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On exploring always-connected temporal graphs of small pathwidth |
scientific article |
Statements
On exploring always-connected temporal graphs of small pathwidth (English)
0 references
5 December 2018
0 references
graph algorithms
0 references
computational complexity
0 references
temporal graphs
0 references
graph exploration
0 references
pathwidth
0 references
