algorithm - Finding "strongly connected" subgraphs in a Graph -
i trying find algorithm find sub graphs in undirected connected graph, each vertex in subgraph has border every other vertex in subgraph.
my real problem having problem classifying problem, can research possible algorithms or solutions.
would know problem called or there existing algorithms accomplish this?
i believe referring clique problem.
algorithm theory graph-theory
No comments:
Post a Comment