Keyword : graph algorithms


Generation of Symmetric and Asymmetric Biconnected Rooted Triangulated Planar Graphs
Bingbing ZHUANG Hiroshi NAGAMOCHI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2011/02/01
Vol. E94-D  No. 2 ; pp. 200-210
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science -- Mathematical Foundations and Applications of Algorithms and Computer Science --)
Category: 
Keyword: 
enumerationreflective symmetrytriangulationplane graphsplanar graphsbiconnectivitygraph algorithms
 Summary | Full Text:PDF(886.5KB)

An Optimal Parallel Algorithm for Constructing a Spanning Tree on Circular Permutation Graphs
Hirotoshi HONMA Saki HONMA Shigeru MASUYAMA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2009/02/01
Vol. E92-D  No. 2 ; pp. 141-148
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science)
Category: 
Keyword: 
parallel algorithmsgraph algorithmscircular permutation graphsspanning tree
 Summary | Full Text:PDF(615.5KB)

Node-Disjoint Paths Algorithm in a Transposition Graph
Yasuto SUZUKI Keiichi KANEKO Mario NAKAMORI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2006/10/01
Vol. E89-D  No. 10 ; pp. 2600-2605
Type of Manuscript:  PAPER
Category: Algorithm Theory
Keyword: 
interconnection networksgraph algorithmstransposition graphsnode-to-set disjoint pathsparallel computing
 Summary | Full Text:PDF(331.3KB)

Another Simple Algorithm for Edge-Coloring Bipartite Graphs
Takashi TAKABATAKE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/05/01
Vol. E88-A  No. 5 ; pp. 1303-1304
Type of Manuscript:  Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
bipartite matchingedge-coloringgraph algorithmscombinatorial optimization
 Summary | Full Text:PDF(57.5KB)

I/O-Efficient Multilevel Graph Partitioning Algorithm for Massive Graph Data
Jun-Ho HER R.S. RAMAKRISHNA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2004/07/01
Vol. E87-D  No. 7 ; pp. 1789-1794
Type of Manuscript:  Special Section PAPER (Special Section on Hardware/Software Support for High Performance Scientific and Engineering Computing)
Category: Scientific and Engineering Computing with Applications
Keyword: 
graph algorithmsI/O-efficiencyI/O-complexityexternal memory algorithms
 Summary | Full Text:PDF(615.7KB)

Node-to-Set Disjoint Paths Problem in Pancake Graphs
Keiichi KANEKO Yasuto SUZUKI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2003/09/01
Vol. E86-D  No. 9 ; pp. 1628-1633
Type of Manuscript:  Special Section PAPER (Special Issue on Parallel and Distributed Computing, Applications and Technologies)
Category: Algorithms and Applications
Keyword: 
interconnection networksgraph algorithmspancake graphnode-to-set disjoint pathsparallel computing
 Summary | Full Text:PDF(327.6KB)

Parallel Algorithms for Maximal Linear Forests
Ryuhei UEHARA Zhi-Zhong CHEN 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1997/04/25
Vol. E80-A  No. 4 ; pp. 627-634
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
parallel algorithmsrandomized parallel algorithmsgraph algorithmslinear forestsmaximal matchingsmaximal independent sets
 Summary | Full Text:PDF(720KB)

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)

Algorithms for Finding the Largest Subtree whose Copies Cover All the Leaves
Tatsuya AKUTSU Satoshi KOBAYASHI Koichi HORI Setsuo OHSUGA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1993/06/25
Vol. E76-D  No. 6 ; pp. 707-710
Type of Manuscript:  LETTER
Category: Algorithm and Computational Complexity
Keyword: 
algorithmsmacro operatorlearninggraph algorithmssubtree
 Summary | Full Text:PDF(241.8KB)

A Minimum Path Decomposition of the Hasse Diagram for Testing the Consistency of Functional Dependencies
Atsuhiro TAKASU Tatsuya AKUTSU 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1993/02/25
Vol. E76-D  No. 2 ; pp. 299-301
Type of Manuscript:  LETTER
Category: Algorithm and Computational Complexity
Keyword: 
graph algorithmsdatabase querypartial match retrievaldisjoint paths
 Summary | Full Text:PDF(158.1KB)