Presentation 1994/10/21
Graph Inference from a Walk for Trees of Bounded Degree 3 is NP-Complete
Osamu Maruyama, Satoru Miyano,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The graph inference from a walk for a class C of undirected edge- colored graphs is,given a string x of colors,finding the smallest graph in C that realizes a walk whose sequence of edgecolors coincides with x.It has been known that the problem for graphs of bounded degree k(【greater than or equal】3)is NP-complete,while th e problem for trees without degree bound lias been known to be solvable in O(n)time,where n is the length of the string.Then we prove that the graph inference from a walk for trees of bounded degree k(【greater than or equal】3)is NP-complete.Furthermore,the problem for a special case of trees of bounded degree 3,called(1, 1)-caterpillars,is shown NP-complete.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) graph interence / trace / caterpillar / walk / tree / degree
Paper # COMP94-53
Date of Issue

Conference Information
Committee COMP
Conference Date 1994/10/21(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Graph Inference from a Walk for Trees of Bounded Degree 3 is NP-Complete
Sub Title (in English)
Keyword(1) graph interence
Keyword(2) trace
Keyword(3) caterpillar
Keyword(4) walk
Keyword(5) tree
Keyword(6) degree
1st Author's Name Osamu Maruyama
1st Author's Affiliation Interdisciplinary Graduate School of Engineering Science,Kyushu University()
2nd Author's Name Satoru Miyano
2nd Author's Affiliation Research Institute of Fundamental Information Science,The Faculty of Science,Kyushu University
Date 1994/10/21
Paper # COMP94-53
Volume (vol) vol.94
Number (no) 304
Page pp.pp.-
#Pages 9
Date of Issue