In this paper we consider an optimal vertex ordering problem of graphs. The vertex ordering and an optimality measure are defined. It is proved that the optimal ordering problem under consideration can be transformed into the well-known minimum-weight spanning tree problem and is therefore solvable in low-polynomial time. We also investigate some properties of optimal vertex orderings. (C) 1999 Elsevier Science B.V. All rights reserved.
机构:
East Tennessee State Univ, Dept Math & Stat, Johnson City, TN 37614 USA
Univ Johannesburg, Dept Math & Appl Math, ZA-2006 Auckland Pk, South AfricaEast Tennessee State Univ, Dept Math & Stat, Johnson City, TN 37614 USA
Haynes, Teresa W.
Hedetniemi, Stephen T.
论文数: 0引用数: 0
h-index: 0
机构:
Clemson Univ, Sch Comp, Clemson, SC 29634 USAEast Tennessee State Univ, Dept Math & Stat, Johnson City, TN 37614 USA