• 홈
  • k-edge-connected graph

k-edge-connected graph

graph that remains connected whenever fewer than k edges are removed

en-US/ˈkeɪ - ˈɛd͡ʒ - kəˈnɛktɪd ˈɡɹæf/
en-GB/ˈkeɪ - ˈɛd͡ʒ - kəˈnɛktɪd ɡɹɑːf/

카테고리:

connected graph