Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

19

IEICET
2011

favoriteEmaildiscussreport

191views Information Technology» more IEICET 2011»

Minimum Spanning Tree Problem with Label Selection

12 years 11 months ago

Minimum Spanning Tree Problem with Label Selection

Download www.jaist.ac.jp

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.

Akio Fujiyoshi, Masakazu Suzuki

Real-time Traffic

Acyclic Graphs | IEICET 2011 | Information Technology | Spanning Tree Problem | Tree Problem |

claim paper

Related Content

» Solving the Minimum Label Spanning Tree Problem by Ant Colony Optimization

» The blob code is competitive with edgesets in genetic algorithms for the minimum routing c...

» LinearTime Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs

» Approximation algorithms and hardness results for labeled connectivity problems

» Computing a DiameterConstrained Minimum Spanning Tree in Parallel

» A Weighted Coding in a Genetic Algorithm for the DegreeConstrained Minimum Spanning Tree P...

» Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs

» The MinimumArea Spanning Tree Problem

» The Directed MinimumDegree Spanning Tree Problem

Post Info
More Details (n/a)

Added	14 May 2011
Updated	14 May 2011
Type	Journal
Year	2011
Where	IEICET
Authors	Akio Fujiyoshi, Masakazu Suzuki

Comments (0)