IEICE Trans

Sumio MASUDA

An Exact Algorithm for the Arrow Placement Problem in Directed Graph Drawings Naoto KIDO Sumio MASUDA Kazuaki YAMAGUCHI
Publication: Publication Date: 2019/11/01 Vol. E102-A No. 11 pp. 1481-1489 Type of Manuscript: PAPER Category: Algorithms and Data Structures Keyword: directed graph, drawing, arrow placement, exact algorithm,
	Summary \| Full Text:PDF

An A^* Algorithm with a New Heuristic Distance Function for the 2-Terminal Shortest Path Problem Kazuaki YAMAGUCHI Sumio MASUDA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2006/02/01 Vol. E89-A No. 2 pp. 544-550 Type of Manuscript: PAPER Category: Algorithms and Data Structures Keyword: shortest path, preprocessing, A^* algorithm, routing,
	Summary \| Full Text:PDF

Placement of Vertex Labels in a Graph Drawing Noboru ABE Sumio MASUDA Kazuaki YAMAGUCHI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2004/10/01 Vol. E87-A No. 10 pp. 2774-2779 Type of Manuscript: PAPER Category: Graphs and Networks Keyword: graph, drawing, labeling, algorithm, matching,
	Summary \| Full Text:PDF

A Representation Diagram for Maximal Independent Sets of a Graph Masakuni TAKI Sumio MASUDA Toshinobu KASHIWABARA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1998/05/25 Vol. E81-A No. 5 pp. 784-788 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: maximal independent set, interval graph, cocomparability graph, generation problem,
	Summary \| Full Text:PDF

Two Dimensional Largest Common Subpatterns between Pictures Eiichi TANAKA Sumio MASUDA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1996/09/25 Vol. E79-D No. 9 pp. 1358-1361 Type of Manuscript: LETTER Category: Image Processing,Computer Graphics and Pattern Recognition Keyword: largest common subpattern, longest common subsequence, pattern matching, picture, similarity,
	Summary \| Full Text:PDF

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/25 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

A Metric between Unrooted and Unordered Trees and Its Top-down Computing Method Tomokazu MUGURUMA Eiichi TANAKA Sumio MASUDA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1994/05/25 Vol. E77-D No. 5 pp. 555-566 Type of Manuscript: PAPER Category: Algorithm and Computational Complexity Keyword: tree metric, tree similarity, unrooted and unordered tree, dynamic programming, chemical information system,
	Summary \| Full Text:PDF

Testing the k-Layer Routability in a Circular Channel--Case in which No Nets Have Two Terminals on the Same Circle-- Noriya KOBAYASHI Toshinobu KASHIWABARA Sumio MASUDA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1992/02/25 Vol. E75-A No. 2 pp. 233-239 Type of Manuscript: PAPER Category: Computer Aided Design (CAD) Keyword: algorithm, routing, via minimization, layer assignment,
	Summary \| Full Text:PDF

Testing the Two-Layer Routability in a Circular Channel Noriya KOBAYASHI Masahiro ABE Toshinobu KASHIWABARA Sumio MASUDA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1992/01/25 Vol. E75-A No. 1 pp. 83-91 Type of Manuscript: PAPER Category: Computer Aided Design (CAD) Keyword: algorithm, routing problem, via minimization,
	Summary \| Full Text:PDF

Algorithms to Obtain a Maximal Planar Hamilton Subgraph Noriya KOBAYASHI Sumio MASUDA Toshinobu KASHIWABARA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1991/04/25 Vol. E74-A No. 4 pp. 657-664 Type of Manuscript: Special Section PAPER (Special Issue on Discrete Mathematics and Its Applications) Category: Keyword:
	Summary \| Full Text:PDF

Finding a Maximal Outerplanar Spanning Subgraph of a Graph Sumio MASUDA Toshinobu KASHIWABARA
Publication: IEICE TRANSACTIONS (1976-1990) Publication Date: 1990/04/25 Vol. E73-E No. 4 pp. 532-538 Type of Manuscript: PAPER Category: Algorithm, Data Structure and Computational Complexity Keyword:
	Summary \| Full Text:PDF