Graph inference from a walk for trees of bounded degree 3 is NP-complete

Osamu Maruyama, Satoru Miyano

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

3 被引用数 (Scopus)

抄録

The graph inference from a walk for a class C of undirected edgecolored graphs is, given a string x of colors, finding the smallest graph G in C that allows a traverse of all edges in G whose sequence of edge-colors is x, called a walk for x. We prove that the graph inference from a walk for trees of bounded degree k is NP-complete for any k ≥ 3, while the problem for trees without any degree bound constraint is known to be solvable in O(n) time, where n is the length of the string. Furthermore, the problem for a special class of trees of bounded degree 3, called (1,1)-caterpillars, is shown to be NP-complete. This contrast with the case that the problem for linear chains is known to be solvable in O(nlog n) time since a (1,1)-caterpillar is obtained by attaching at most one hair of length one to each node of a linear chain. We also show the MAXSNP-hardness of these problems.

本文言語英語
ホスト出版物のタイトルMathematical Foundations of Computer Science 1995 - 20th International Symposium, MFCS 1995, Proceedings
編集者Jiri Wiedermann, Petr Hajek
出版社Springer Verlag
ページ257-266
ページ数10
ISBN(印刷版)3540602461, 9783540602460
DOI
出版ステータス出版済み - 1995
イベント20th International Symposium on Mathematical Foundations of Computer Science, MFCS 1995 - Prague, チェコ共和国
継続期間: 8 28 19959 1 1995

出版物シリーズ

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

その他

その他20th International Symposium on Mathematical Foundations of Computer Science, MFCS 1995
国/地域チェコ共和国
CityPrague
Period8/28/959/1/95

All Science Journal Classification (ASJC) codes

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

フィンガープリント

「Graph inference from a walk for trees of bounded degree 3 is NP-complete」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル