Note--A Simple Edge Elimination Criterion in a Search for the Center of a Graph

Jonathan Halpern
Additional contact information
Jonathan Halpern: University Calgary and Techion, Haifa

Management Science, 1979, vol. 25, issue 1, 105-107

Abstract: This note proposes a new edge elimination criterion in an algorithm whose purpose is to locate the center of a graph. The new criterion requites the same amount of information and computation but generates a stronger lower bound. It therefore reduces substantially the number of edges that have to be checked thoroughly, at a high computational cost, for a possible center point along them.

Keywords: center; graph; location (search for similar items in EconPapers)
Date: 1979
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.25.1.105 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:25:y:1979:i:1:p:105-107

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().