Please use this identifier to cite or link to this item: doi:10.22028/D291-26470
Title: Finding a negative cycle in a directed graph
Author(s): Tsakalidis, Athanasios K.
Language: English
Year of Publication: 1985
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: We present an algorithm implemented on a pointer machine which can find a negative Cycle in a directed graph in worst case Time O(n.e), where n is the number of nodes and e the number of edges, using only linear Space O(n+e). The best previous result was due to D.Maier [5]. His algorithm is running on a random access machine in worst case Time O(n(e+nlog n/log nlog n)) and uses Space O(e+nlog n/log nlog n).
Link to this record: urn:nbn:de:bsz:291-scidok-51759
Series name: Bericht / A / Fachbereich Angewandte Mathematik und Informatik, Universität des Saarlandes
Series volume: 1985/05
Date of registration: 4-Apr-2013
Faculty: MI - Fakultät für Mathematik und Informatik
Department: MI - Informatik
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
fb14_1985_05.pdf10,94 MBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.