Home > Term: fully dynamic graph problem
fully dynamic graph problem
Problem where the update operations include unrestricted insertions and deletions of edges.
- Jenis Kata: noun
- Industri / Domain: Sains komputer
- Kategori: Algorithms & data structures
- Government Agency: NIST
0
Penulis
- GeorgeV
- 100% positive feedback