The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
S'il existe deux sommets dans G dont la distance s'allonge lorsqu'un sommet u est supprimé, alors u est défini comme un sommet charnière. Trouver l'ensemble des sommets charnières dans un graphique est utile pour identifier les nœuds critiques dans un réseau réel. Un certain nombre d'études concernant les sommets charnières ont été réalisées ces dernières années. Dans un certain nombre de problèmes de graphes, il est connu que des algorithmes séquentiels ou parallèles plus efficaces peuvent être développés en limitant les classes de graphes. Dans cet article, nous proposerons un algorithme parallèle qui s'exécute dans O(Journal n) temps avec O(n) processeurs sur CREW PRAM pour trouver tous les sommets charnières d'un graphique trapézoïdal.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Hirotoshi HONMA, Shigeru MASUYAMA, "A Parallel Algorithm for Finding All Hinge Vertices of a Trapezoid Graph" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 5, pp. 1031-1040, May 2002, doi: .
Abstract: If there exist any two vertices in G whose distance becomes longer when a vertex u is removed, then u is defined as a hinge vertex. Finding the set of hinge vertices in a graph is useful for identifying critical nodes in an actual network. A number of studies concerning hinge vertices have been made in recent years. In a number of graph problems, it is known that more efficient sequential or parallel algorithms can be developed by restricting classes of graphs. In this paper, we shall propose a parallel algorithm which runs in O(log n) time with O(n) processors on CREW PRAM for finding all hinge vertices of a trapezoid graph.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_5_1031/_p
Copier
@ARTICLE{e85-a_5_1031,
author={Hirotoshi HONMA, Shigeru MASUYAMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Parallel Algorithm for Finding All Hinge Vertices of a Trapezoid Graph},
year={2002},
volume={E85-A},
number={5},
pages={1031-1040},
abstract={If there exist any two vertices in G whose distance becomes longer when a vertex u is removed, then u is defined as a hinge vertex. Finding the set of hinge vertices in a graph is useful for identifying critical nodes in an actual network. A number of studies concerning hinge vertices have been made in recent years. In a number of graph problems, it is known that more efficient sequential or parallel algorithms can be developed by restricting classes of graphs. In this paper, we shall propose a parallel algorithm which runs in O(log n) time with O(n) processors on CREW PRAM for finding all hinge vertices of a trapezoid graph.},
keywords={},
doi={},
ISSN={},
month={May},}
Copier
TY - JOUR
TI - A Parallel Algorithm for Finding All Hinge Vertices of a Trapezoid Graph
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1031
EP - 1040
AU - Hirotoshi HONMA
AU - Shigeru MASUYAMA
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E85-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2002
AB - If there exist any two vertices in G whose distance becomes longer when a vertex u is removed, then u is defined as a hinge vertex. Finding the set of hinge vertices in a graph is useful for identifying critical nodes in an actual network. A number of studies concerning hinge vertices have been made in recent years. In a number of graph problems, it is known that more efficient sequential or parallel algorithms can be developed by restricting classes of graphs. In this paper, we shall propose a parallel algorithm which runs in O(log n) time with O(n) processors on CREW PRAM for finding all hinge vertices of a trapezoid graph.
ER -