algorithm - How to find the maximum edge-weighted clique? -


the maximum clique problem(mc-problem) classical np problem, , use branch-bound solve problem effectively. recently, try develop algorithm find out clique has maximum edge-weighted clique in graph, know, maximum edge-weighted clique problem(mec-problem).

i have found properties problem. first, clique must maximal clique not belong larger clique. sum of edges of clique must largest of maximal clique.

however, traditional algorithm of mc-problem not effective on mec-problem. therefore, want find effective algorithm on mec-problem, branch-bound algorithm.

thank you.

i don't think branch-and-bound algorithm can "effectively" solve max-clique problem.

your algorithm may perform in application field data. however, intelligent exponential search - such backtracking , branch-and-bound exponential in worst case.

the maximum edge-weighted clique problem polynomial turing reducible max-clique problem. equivalent each other in computational complexity.

my suggestion focus more on data properties. analyze application instances may contribute more algorithm's practical time performance.


Comments

Popular posts from this blog

SPSS keyboard combination alters encoding -

Add new record to the table by click on the button in Microsoft Access -

javascript - jQuery .height() return 0 when visible but non-0 when hidden -