Home > Term: fully dynamic graph problem
fully dynamic graph problem
Problem where the update operations include unrestricted insertions and deletions of edges.
- Kalbos dalis: noun
- Pramonės šaka / sritis: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
Kūrėjas
- GeorgeV
- 100% positive feedback