On the size and the approximability of minimum temporally connected subgraphs (Q4598293)
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: On the size and the approximability of minimum temporally connected subgraphs |
scientific article; zbMATH DE number 6820338
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the size and the approximability of minimum temporally connected subgraphs |
scientific article; zbMATH DE number 6820338 |
Statements
19 December 2017
0 references
temporal graphs
0 references
temporal connectivity
0 references
approximation algorithms
0 references
On the Size and the Approximability of Minimum Temporally Connected Subgraphs (English)
0 references
0.7877998352050781
0 references
0.779670774936676
0 references
0.7783156037330627
0 references
0.7690912485122681
0 references
0.7680230140686035
0 references
