Keyword : subgraph isomorphism


Formulation of Mobile Agent Allocation and Its Strong NP-Completeness
Atsushi SASAKI Tadashi ARARAGI Shigeru MASUYAMA Keizo MIYATA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2005/05/01
Vol. E88-D  No. 5 ; pp. 1060-1063
Type of Manuscript:  LETTER
Category: Complexity Theory
Keyword: 
strong NP-completenessmobile agentscommunication costsubgraph isomorphismload balancing
 Summary | Full Text:PDF(123KB)

A Linear Time Pattern Matching Algorithm between a String and a Tree
Tatsuya AKUTSU 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1994/03/25
Vol. E77-D  No. 3 ; pp. 281-287
Type of Manuscript:  PAPER
Category: Algorithm and Computational Complexity
Keyword: 
subtreesubgraph isomorphismstring matchingsuffix treegraph algorithms
 Summary | Full Text:PDF(473.1KB)

A Polynomial Time Algorithm for Finding a Largest Common Subgraph of almost Trees of Bounded Degree
Tatsuya AKUTSU 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1993/09/25
Vol. E76-A  No. 9 ; pp. 1488-1493
Type of Manuscript:  PAPER
Category: Algorithms, Data Structures and Computational Complexity
Keyword: 
largest common subgraphsubgraph isomorphismalmost treesNP-complete
 Summary | Full Text:PDF(397.7KB)

An RNC Algorithm for Finding a Largest Common Subtree of Two Trees
Tatsuya AKUTSU 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1992/01/25
Vol. E75-D  No. 1 ; pp. 95-101
Type of Manuscript:  Special Section PAPER (Special Section on Theoretical Foundations of Computing)
Category: 
Keyword: 
largest common subtreesubgraph isomorphismparallel algorithmsrandom NC algorithmsdynamic tree contraction
 Summary | Full Text:PDF(512.7KB)