Minimum Spanning Tree Problem with Label Selection

In this paper, we study the minimum spanning tree problem for vertex-labeled graphs, where the weights of edges may vary depending on the selection of labels of vertices at both ends. The problem is especially important as the application to mathematical OCR. It is shown that the problem is NP-hard even on directed acyclic graphs (DAGs). However, there exists a linear-time algorithm for graphs of small tree-width. The relation to the generalized minimum spanning tree problem is discussed.

• Type: Journal
• Year: 2011
• Where: IEICET
• Authors: Akio Fujiyoshi, Masakazu Suzuki
• Keywords: Acyclic Graphs, IEICET 2011, Information Technology, Spanning Tree Problem, Tree Problem