Home > Term: fully dynamic graph problem
fully dynamic graph problem
Problem where the update operations include unrestricted insertions and deletions of edges.
- Besedna vrsta: noun
- Industrija/področje: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
Avtor
- GeorgeV
- 100% positive feedback