An optimal algorithm for finding compact sets (Q1209360): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3619797 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4893476 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A fast algorithm for finding the compact sets / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 16:35, 17 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An optimal algorithm for finding compact sets |
scientific article |
Statements
An optimal algorithm for finding compact sets (English)
0 references
16 May 1993
0 references
optimal algorithm
0 references
minimum spanning tree
0 references
compact sets
0 references
weighted undirected graph
0 references