label: url

en: A polynomial-time algorithm for finding a spanning tree with non-terminal set VNT on circular-arc graphs

en: IEICE Transactions on Information and Systems


en: A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Series-Parallel Graphs

ja: IEICE Transactions on Information and Systems


en: A linear-time algorithm for finding a spanning tree with non-terminal set VNT on interval graphs

en: Given a graph G=(V,E) where V and E are a vertex and an edge set, respectively, specified with a subset VNT of vertices called a non-terminal set, the spanning tree with non-terminal set VNT is a connected and acyclic spanning subgraph of G that contains all the vertices of V where each vertex in a non-terminal set is not a leaf. The complexity of finding a spanning tree with non-terminal set VNT on general graphs where each edge has the weight of one is known to be NP-hard. In this paper, we show that if G is an interval graph then finding a spanning tree with a non-terminal set VNT of G is linearly-solvable when each edge has the weight of one.


en: A linear time algorithm for finding a minimum spanning tree with non-terminal set VNT on outerplanar graphs.


en: A linear time algorithm for finding a spanning tree with non-terminal set $V_{NT}$ on cographs.


en: A Polynomial Time Algorithm for Solving a 2-Tuple Domination Problem on Permutation Graphs

en: 回路とシステムシンポジウム

ja: 回路とシステムシンポジウム


en: A Polynomial Time Algorithm for Obtaining Minimum Edge Ranking on Two-connected Outerplanar Graphs

en: Information Processing Letters

ja: Information Processing Letters


en: A Polynomial Time Algorithm for Obtaining a Minimum Vertex Ranking Spanning Tree in Outerplanar Graphs

en: The minimum vertex ranking spanning tree problem is to find a spanning tree of G whose vertex ranking is minimum. This problem is NP-hard and no polynomial time algorithm for solving it is known for non-trivial classes of graphs other than the class of interval graphs. This paper proposes a polynomial time algorithm for solving the minimum vertex ranking spanning tree problem on outerplanar graphs.


en: NP-hardness proof and an approximation algorithm for the maximum vertex ranking spanning tree problem

en: Discrete Applied Mathematics

ja: Discrete Applied Mathematics


en: An algorithm for solving the minimum vertex ranking spanning tree problem on interval graphs

en: The minimum vertex ranking spanning tree problem is to find a spanning tree of G whose vertex ranking is minimum. This paper proposes an O(n^3) time algorithm for solving the minimum vertex ranking spanning tree problem on an interval graph.

en: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences


en: An Algorithm for Finding Two Edge-Disjoint Paths in Tournaments

en: This paper presents an O(n^2)-time algorithm for constructing two edge-disjoint paths connecting two given pairs of vertices in a given tournament graph. It improves the time complexity of a previously known O(n^4)-time algorithm.

ja: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences


en: What Structural Features Make Graph Problems to Have Efficient Parallel Algorithms? Using Outerplanar Graphs, Trapezoid Graphs and In-Tournament Graphs as Examples

en: This paper analyzes what structural features of graph problems allow efficient parallel algorithms. We survey some parallel algorithms for typical problems on three kinds of graphs, outerplanar graphs, trapeziod graphs and in-tournament graphs. Our results on the shortest path problem, the longest path problem and the maximum flow problem on outerplanar graphs, the minimum-weight connected dominating set problem and the coloring problem on trapezoid graphs and Hamiltonian path and Hamiltonian cycle problem on in-tournament graphs are adopted as working examples.

en: IEICE Transactions on Information and Systems


en: Parallel Algorithms for Finding a Hamiltonian Path and a Hamiltonian Cycle in an In-Tournament Graph


en: A Parallel Algorithm for Solving the Coloring Problem on Trapezoid Graphs


en: A Parallel Algorithm for Finding a Minimum-Weight Connected Dominating Set on Trapezoid Graphs

en: Mathematica Japonica

ja: Mathematica Japonica


en: 2連結グラフ上の与えられた節点を中心とする全域木を求める並列アルゴリズム

ja: 2連結グラフ上の与えられた節点を中心とする全域木を求める並列アルゴリズム

en: The Transactions of the Institute of Electronics, Information and Communication Engineers D-I

ja: 電子情報通信学会論文誌(D-I)


en: 外平面グラフ上の最大流を求める並列アルゴリズム

ja: 外平面グラフ上の最大流を求める並列アルゴリズム

ja: 電子情報通信学会論文誌(D-I)


en: 外平面グラフ上のst-最短経路を求める並列アルゴリズム

ja: 外平面グラフ上のst-最短経路を求める並列アルゴリズム

ja: 電子情報通信学会論文誌(D-I)


en: 外平面グラフの最長路問題を解く並列アルゴリズム

ja: 外平面グラフの最長路問題を解く並列アルゴリズム

ja: 電子情報通信学会論文誌(D-I)


en: A Simple Near Optimal Parallel Algorithm for Recognizing Outerplanar Graphs

en: Natural Science Research, Faculty of Integrated Arts and Sciences, The University of Tokushima