IEICE SEARCH SYSTEM

Keyword : tree

Partitioning Trees with Supply, Demand and Edge-Capacity Masaki KAWABATA¡Ê9999999¡Ë Kwansei Gakuin University¡¨Takao NISHIZEKI¡Ê6807319¡Ë Kwansei Gakuin University
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2013/06/01 Vol. E96-A No. 6 pp. 1036-1043 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: tree, maximum partition problem, supply, demand, edge-capacity, approximation algorithm,
	Summary \| Full Text:PDF (1.2MB)

An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree Takehiro ITO Kazuto KAWAMURA Xiao ZHOU
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2012/03/01 Vol. E95-D No. 3 pp. 737-745 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science – Mathematical Foundations and Applications of Computer Science and Algorithms –) Category: Keyword: graph algorithm, list edge-coloring, reachability on solution space, reconfiguration problem, tree,
	Summary \| Full Text:PDF (358KB)

Optimal Algorithms for Finding the Longest Path with Length and Sum Constraints in a Tree Sung Kwon KIM
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2011/06/01 Vol. E94-D No. 6 pp. 1325-1328 Type of Manuscript: LETTER Category: Fundamentals of Information Systems Keyword: length constraint, longest path, sum constraint, tree,
	Summary \| Full Text:PDF (85.5KB)

Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings Takehiro ITO Naoki SAKAMOTO Xiao ZHOU Takao NISHIZEKI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2011/02/01 Vol. E94-D No. 2 pp. 190-195 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science -- Mathematical Foundations and Applications of Algorithms and Computer Science --) Category: Keyword: algorithm, cost edge-coloring, multitree, perfect matching, tree,
	Summary \| Full Text:PDF (537.5KB)

Path Maximum Query and Path Maximum Sum Query in a Tree Sung Kwon KIM Jung-Sik CHO Soo-Cheol KIM
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2009/02/01 Vol. E92-D No. 2 pp. 166-171 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science) Category: Keyword: path maximum query, path maximum sum query, tree,
	Summary \| Full Text:PDF (489.4KB)

Self-Stabilizing Agent Traversal on Tree Networks Yoshihiro NAKAMINAMI Toshimitsu MASUZAWA Ted HERMAN
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2004/12/01 Vol. E87-D No. 12 pp. 2773-2780 Type of Manuscript: PAPER Category: Distributed Cooperation and Agents Keyword: agent traversal, tree, self-stabilization,
	Summary \| Full Text:PDF (298.2KB)

Distance between Rooted and Unordered Trees Based on Vertex and Edge Mappings Shaoming LIU
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2004/05/01 Vol. E87-A No. 5 pp. 1034-1041 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: tree, graph, structure, pattern, distance, similarity, mapping, algorithm, pattern matching,
	Summary \| Full Text:PDF (275.1KB)

Cost Total Colorings of Trees Shuji ISOBE Xiao ZHOU Takao NISHIZEKI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2004/02/01 Vol. E87-D No. 2 pp. 337-342 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science) Category: Keyword: cost total coloring, dynamic programming, matching, total coloring, tree,
	Summary \| Full Text:PDF (245.2KB)

Efficient Algorithms for Finding a Tree 3-Spanner on Permutation Graphs Hon-Chan CHEN Shin-Huei WU Chang-Biau YANG
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2003/11/01 Vol. E86-D No. 11 pp. 2390-2394 Type of Manuscript: PAPER Category: Algorithms Keyword: tree, spanner, permutation graph, algorithm,
	Summary \| Full Text:PDF (242.2KB)

Transitive Signature Scheme for Directed Trees Hidenori KUWAKADO Hatsukazu TANAKA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2003/05/01 Vol. E86-A No. 5 pp. 1120-1126 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: transitive signature, fail-stop signature, tree, graph,
	Summary \| Full Text:PDF (224.1KB)

Scheduling Trees onto Hypercubes and Grids Satoshi TAYU
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2002/05/01 Vol. E85-A No. 5 pp. 1011-1019 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: task scheduling, tree, hypercube, grid, communication delay,
	Summary \| Full Text:PDF (453.5KB)

Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups Takaaki MIZUKI Takao NISHIZEKI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2002/02/01 Vol. E85-D No. 2 pp. 333-345 Type of Manuscript: Special Section PAPER (Special Issue on Selected Papers from LA Symposium) Category: Keyword: card game, key exchange graph, key set protocol, secret key exchange, tree,
	Summary \| Full Text:PDF (399.4KB)

Solving the Single-Vehicle Scheduling Problems for All Home Locations under Depth-First Routing on a Tree Hiroshi NAGAMOCHI Koji MOCHIZUKI Toshihide IBARAKI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2001/05/01 Vol. E84-A No. 5 pp. 1135-1143 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: vehicle-scheduling, tree, algorithm, location problem,
	Summary \| Full Text:PDF (269.2KB)

Generalized Edge-Rankings of Trees Xiao ZHOU Md. Abul KASHEM Takao NISHIZEKI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1998/02/20 Vol. E81-A No. 2 pp. 310-320 Type of Manuscript: PAPER Category: Algorithms and Data Structures Keyword: algorithm, edge-ranking, tree, separator tree, visible edges,
	Summary \| Full Text:PDF (919KB)

The Largest Common Similar Substructure Problem Shaoming LIU Eiichi TANAKA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1997/04/20 Vol. E80-A No. 4 pp. 643-650 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: algorithm, complexity, common similar substructure, distance, similarity, tree,
	Summary \| Full Text:PDF (695.2KB)

Non-Graph Based Approach on the Analysis of Pointers and Structures Dong-Soo HAN Takao TSUDA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1997/04/20 Vol. E80-D No. 4 pp. 480-488 Type of Manuscript: Special Section PAPER (Special Issue on Parallel and Distributed Supercomputing) Category: Keyword: record handling programs, pointer alias analysis, data structure detection, linear list, tree, dag,
	Summary \| Full Text:PDF (755.2KB)

A Method for Displaying Virtual Spaces of Natural Scenes Employing Fractal-Based Shape Data Simplification and Visual Properties Noriaki KUWAHARA Shin-ichi SHIWA Fumio KISHINO
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1996/06/20 Vol. E79-D No. 6 pp. 781-791 Type of Manuscript: Special Section PAPER (Special Issue on Multimedia Computing and Communications) Category: Keyword: real time 3D CG, fractal, tree, virtual reality, virtual space teleconferencing,
	Summary \| Full Text:PDF (1.5MB)

Metrics between Trees Embedded in a Plane and Their Computing Methods Eiichi TANAKA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1996/04/20 Vol. E79-A No. 4 pp. 441-447 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: distance, dynamic programming, pattern matching, pattern recognition similar structure search, similarity, tree,
	Summary \| Full Text:PDF (521KB)

Efficient Algorithms for Finding Largest Similar Substructures in Unordered Trees Shaoming LIU Eiichi TANAKA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1996/04/20 Vol. E79-A No. 4 pp. 428-440 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: algorithm, complexity, distance, similar structure, tree,
	Summary \| Full Text:PDF (896.5KB)

The Distances between Unrooted and Cyclically Ordered Trees and Their Computing Methods Shaoming LIU Eiichi TANAKA Sumio MASUDA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1994/10/20 Vol. E77-D No. 10 pp. 1094-1105 Type of Manuscript: PAPER Category: Algorithm and Computational Complexity Keyword: tree, graph, distance, similarity, algorithm, pattern matching,
	Summary \| Full Text:PDF (873.3KB)

Properties of W-Tree Hua-An ZHAO Wataru MAYEDA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1992/09/20 Vol. E75-A No. 9 pp. 1141-1147 Type of Manuscript: PAPER Category: Graphs, Networks and Matroids Keyword: graph, tree, W-graph, W-tree,
	Summary \| Full Text:PDF (496.2KB)