Treffer: An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs
Title:
An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs
Source:
International journal of computer mathematics. 72(4):449-462
Publisher Information:
Abingdon: Taylor and Francis, 1999.
Publication Year:
1999
Physical Description:
print, 12 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Théorie des graphes, Graph theory, Algorithme parallèle, Parallel algorithm, Algoritmo paralelo, Algorithme, Algorithm, Algoritmo, Complexité, Complexity, Complejidad, Conception, Design, Diseño, Connexité, Connectedness, Conexidad, Graphe non orienté, Non directed graph, Grafo no orientado, Structure donnée, Data structure, Estructura datos, Théorie graphe, Graph theory, Teoría grafo, Algorithme séquentiel, Sequential algorithm, Articulation, Cut vertex, Graphe permutation, Permutation graph
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore-721 102, India
Department of Mathematics, Midnapore College, Midnapore-721 101, India
Department of Mathematics, Midnapore College, Midnapore-721 101, India
ISSN:
0020-7160
Rights:
Copyright 2000 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Mathematics
Accession Number:
edscal.1242386
Database:
PASCAL Archive
Weitere Informationen
In this paper, a set of intervals is constructed by projecting geometrical representation of permutation graph to find all cutvertices and blocks of a permutation graph. The sequential and parallel algorithms are designed to find all cutvertices and blocks of permutation graphs. The sequential algorithms takes O(n) time and parallel algorithm takes O(log n) time using O(n/log n) processors on an EREW PRAM, where n represents the number of vertices of the graph.