Minimum 0-Extensions of Graph Metrics

• 31 January 1998
• journal article
• Published by Elsevier in European Journal of Combinatorics
• Vol. 19  (1) , 71-101
• https://doi.org/10.1006/eujc.1997.0154

Abstract

Keywords

• FUNCTION
• CUT PROBLEM
• NP HARD
• CIRCUIT
• MINIMUM
• IFH
• ORIENTABLE
• DISTANCE
• EXTENSION