Home > Term: k-connected graph
k-connected graph
A connected graph such that deleting any k-1 vertices (and incident edges) results in a graph that is still connected.
- Jenis Kata: noun
- Industri / Domain: Sains komputer
- Kategori: Algorithms & data structures
- Government Agency: NIST
0
Penulis
- GeorgeV
-
(Gold) 1123 poin - 100% positive feedback
