Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty (Q6196899): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q130202040, #quickstatements; #temporary_batch_1728590947029 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q130202040 / rank | |||
Normal rank | |||
Latest revision as of 22:42, 10 October 2024
scientific article; zbMATH DE number 7819299
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty |
scientific article; zbMATH DE number 7819299 |
Statements
Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty (English)
0 references
15 March 2024
0 references
cactus graphs
0 references
competitive analysis
0 references
explorable uncertainty
0 references
online algorithms
0 references
randomized algorithms
0 references
spanning tree
0 references
