1. Repository of OAI
  2. ΑΠΟΘΕΤΗΡΙΟ "ΟΛΥΜΠΙΑΣ"
  3. Σχολή Θετικών Επιστημών
  4. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής
  5. Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)
Ελληνικά   English  
Please use this identifier to cite or link to this item: https://olympias.lib.uoi.gr/jspui/handle/123456789/10834
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNikolopoulos, Stavros D.en
dc.contributor.authorDanielopoulos, Stylianos D.en
dc.date.accessioned2015-11-24T17:00:53Z-
dc.date.available2015-11-24T17:00:53Z-
dc.identifier.issn1063-7192-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/10834-
dc.rightsDefault Licence-
dc.titleFAST PARALLEL ALGORITHMS FOR FINDING CUTPOINTS AND BRIDGES OF UNDIRECTED GRAPHSen
heal.typejournalArticle-
heal.type.enJournal articleen
heal.type.elΆρθρο Περιοδικούel
heal.identifier.primary10.1080/10637199408962525-
heal.languageen-
heal.accesscampus-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικήςel
heal.publicationDate1994-
heal.abstractABSTRACT In this paper we present fast parallel algorithms for finding the cutpoints and bridges of an undirected graph G = (V,E) having n vertices. We start with the notion of partitioning a graph in a set of (mutually disjoint) adjacency-level sets, and we propose a parallel algorithm which computes these sets in time O(logL) using L · H · n2 processors on a CRCW-PRAM, where L < n and H < n. Based on the properties of the adjacency-level sets, we formulate parallel algorithms which locate all cutpoints and bridges of an undirected graph in constant time O(1) by using no more than L · H · n2 processors on a CRCW-PRAM computational model.en
heal.publisherTaylor & Francisen
heal.journalNameParallel Algorithms and Applicationsen
heal.journalTypepeer reviewed-
heal.fullTextAvailabilityTRUE-
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)

Show simple item record
Files in This Item:
File Description SizeFormat 
nikolopoulos-1994-FAST PARALLEL ALGORITHMS FOR FINDING CUTPOINTS.pdf664.92 kBAdobe PDFView/Open    Request a copy
Show simple item record  


This item is licensed under a Creative Commons License Creative Commons