MaximumKTruss does not match the requirements
Closed this issue · 0 comments
Torrintino commented
The objective of the algorithm is: find the maximum K-Truss in the graph. So with our function ReduceToKTruss(Graph g, int k), we shall execute ReduceToKTruss iteratively with increasing k, until the Graph has no nodes. This requires, that ReduceToKTruss works on a copy of g, because at some point all edges will be removed.