作成者 |
|
|
本文言語 |
|
出版者 |
|
|
発行日 |
|
収録物名 |
|
巻 |
|
号 |
|
開始ページ |
|
終了ページ |
|
出版タイプ |
|
アクセス権 |
|
関連DOI |
|
関連DOI |
|
|
|
関連URI |
|
|
|
関連情報 |
|
|
|
|
概要 |
In this paper, we introduce a variation of the minimum spanning tree problem for the application to mathematical OCR. The problem is obtained from the original minimum spanning tree problem by importi...ng the notions of "candidate selection" and "link-label selection." It is shown that the problem is NP-hard. However, we find that, for the application to mathematical OCR, it is sufficient to deal with only a class of graphs that is recursively defined with some graphrewriting rules. For the class of graphs, it is shown that the problem can be solved in linear-time in the number of vertices of a graph.続きを見る
|