Erickde's blog

By Erickde, history, 5 years ago, In English

Is there a way to find the diameter of an undirected connected graph if I am removing some nodes from the graph?

I know I can run BFS every time I remove a node, but can I do better?

Full text and comments »

  • Vote: I like it
  • -5
  • Vote: I do not like it

By Erickde, history, 5 years ago, In English

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. Or at least to find any subgraph with diameter 3.

Any help please.

Full text and comments »

  • Vote: I like it
  • -25
  • Vote: I do not like it