IEICE Trans

Keyword : graph algorithms

An Efficient Method for Graph Repartitioning in Distributed Environments He LI YanNa LIU XuHua WANG LiangCai SU Hang YUAN JaeSoo YOO
Publication: Publication Date: 2020/07/01 Vol. E103-D No. 7 ; pp. 1773-1776 Type of Manuscript: LETTER Category: Data Engineering, Web Information Systems Keyword: large graph, dynamic graph, graph partitioning, graph repartitioning, graph algorithms,
	Summary \| Full Text:PDF

Identifying Link Layer Home Network Topologies Using HTIP Yoshiyuki MIHARA Shuichi MIYAZAKI Yasuo OKABE Tetsuya YAMAGUCHI Manabu OKAMOTO
Publication: Publication Date: 2020/03/01 Vol. E103-D No. 3 ; pp. 566-577 Type of Manuscript: PAPER Category: Fundamentals of Information Systems Keyword: home networks, home automation, network topology, graph algorithms, MAC address forwarding tables, HTIP,
	Summary \| Full Text:PDF

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: enumeration, reflective symmetry, triangulation, plane graphs, planar graphs, biconnectivity, graph algorithms,
	Summary \| Full Text:PDF

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 algorithms, graph algorithms, circular permutation graphs, spanning tree,
	Summary \| Full Text:PDF

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 networks, graph algorithms, transposition graphs, node-to-set disjoint paths, parallel computing,
	Summary \| Full Text:PDF

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 matching, edge-coloring, graph algorithms, combinatorial optimization,
	Summary \| Full Text:PDF

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 algorithms, I/O-efficiency, I/O-complexity, external memory algorithms,
	Summary \| Full Text:PDF

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 networks, graph algorithms, pancake graph, node-to-set disjoint paths, parallel computing,
	Summary \| Full Text:PDF

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 algorithms, randomized parallel algorithms, graph algorithms, linear forests, maximal matchings, maximal independent sets,
	Summary \| Full Text:PDF

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: subtree, subgraph isomorphism, string matching, suffix tree, graph algorithms,
	Summary \| Full Text:PDF

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: algorithms, macro operator, learning, graph algorithms, subtree,
	Summary \| Full Text:PDF

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 algorithms, database query, partial match retrieval, disjoint paths,
	Summary \| Full Text:PDF