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...

Full description

Saved in:
Bibliographic Details
Main Authors: L.R. Foulds, John Wilson, T. Yamaguchi
Format: Default Preprint
Published: 2000
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items