Optimal algorithms to compute the closure of a set of iso-rectangles (Q3336711)
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: Optimal algorithms to compute the closure of a set of iso-rectangles |
scientific article; zbMATH DE number 3870614
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal algorithms to compute the closure of a set of iso-rectangles |
scientific article; zbMATH DE number 3870614 |
Statements
Optimal algorithms to compute the closure of a set of iso-rectangles (English)
0 references
1984
0 references
closure of a set of iso-rectangles
0 references
rectilinearly-oriented rectangles
0 references
time and space optimal algorithms
0 references
database concurrency control
0 references
safety
0 references
deadlocks
0 references
locked transaction systems
0 references
0.7727831602096558
0 references
0.7484935522079468
0 references
0.7460426688194275
0 references
