Efficient Union-Find for planar graphs and other sparse graph classes (Q1274324)
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: Efficient Union-Find for planar graphs and other sparse graph classes |
scientific article; zbMATH DE number 1238338
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient Union-Find for planar graphs and other sparse graph classes |
scientific article; zbMATH DE number 1238338 |
Statements
Efficient Union-Find for planar graphs and other sparse graph classes (English)
0 references
12 January 1999
0 references
graph algorithms
0 references
union-find
0 references
planar graphs
0 references
image segmentation
0 references
0 references
