Subgraph with diameter 3

Правка en1, от Erickde, 2022-02-28 00:11:20

I was solving a problem to find all cliques in a Graph. I know a a clique would have a diameter of size 2. After checking this I was wondering if there is any algorithm to get all subgraphs with diameter 3.

Any help please.

Теги graphs, clique, graph, undi

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский Erickde 2022-02-28 00:12:42 52
en1 Английский Erickde 2022-02-28 00:11:20 250 Initial revision (published)