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

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.

• 저널Management Science · 25(1) · 105–107
• 토픽Facility Location and Emergency Management · Organizational Behavior and Human Resource Management
• DOI10.1287/mnsc.25.1.105
• 저자Jonathan Halpern