Modelling and solving central cycle problems with integer programming
We consider the problem of identifying a central subgraph of a given simple connected graph. The case where the subgraph comprises a discrete set of vertices is well known. However, the concept of eccentricity can be extended to connected subgraphs such as: paths, trees and cycles. Methods have been...
|Main Authors:||, ,|
No Tags, Be the first to tag this record!