Inferring a tree from walks

Osamu Maruyama, Satoru Miyano

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

1 被引用数 (Scopus)

抄録

A walk of an edge-colored undirected graph G is a path which contains all edges in G. We show an O(n log n) time algorithm for finding the smallest tree from a walk which allows the walk. If the alphabet of colors is fixed, the algorithm runs in O(n) time. Further, we consider the problem of finding the smallest tree from partial walks, where a partial walk of G is a path in G. We prove that the problem turns to be NP-complete. We also show that inferring the smallest linear chain from partial walks is NP-complete, while the problem of inferring the smallest linear chain from a single walk is known to be solvable in polynomial time.

本文言語英語
ホスト出版物のタイトルMathematical Foundations of Computer Science 1992 - 17 International Symposium, Proceedings
編集者Ivan M. Havel, Vaclav Koubek
出版社Springer Verlag
ページ383-391
ページ数9
ISBN(印刷版)9783540558088
出版ステータス出版済み - 1 1 1992
イベント17th Symposium on Mathematical Foundations of Computer Science, MFCS 1992 - Prague, チェコ共和国
継続期間: 8 24 19928 28 1992

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
629 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他17th Symposium on Mathematical Foundations of Computer Science, MFCS 1992
国/地域チェコ共和国
CityPrague
Period8/24/928/28/92

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Inferring a tree from walks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル