A VERY FAST, PRACTICAL ALGORITHM FOR FINDING A NEGATIVE CYCLE IN A DIGRAPH

被引：0

|

作者：

SPIRAKIS, P

TSAKALIDIS, A

机构：

[1] UNIV SAARLAND, FACHBEREICH 10, ANGEW MATH & INFORMAT, D-6600 SAARBRUCKEN, GERMANY

[2] COMP TECHNOL INST, PATRAS, GREECE

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1986年 / 226卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：397 / 406

页数：10

相关论文

共 50 条

[1] ALGORITHM FOR FINDING A MINIMAL EQUIVALENT GRAPH OF A DIGRAPH
HSU, HT
JOURNAL OF THE ACM, 1975, 22 (01) : 11 - 16
[2] AN ALGORITHM FOR FINDING A MINIMUM EQUIVALENT GRAPH OF A DIGRAPH
MOYLES, DM
THOMPSON, GL
JOURNAL OF THE ACM, 1969, 16 (03) : 455 - &
[3] A polynomial time algorithm for finding a cycle covering a given set of vertices in a semicomplete multipartite digraph
Yeo, A
JOURNAL OF ALGORITHMS, 1999, 33 (01) : 124 - 139
[4] Fast algorithm for finding the eigenvalue distribution of very large matrices
Hams, A
De Raedt, H
PHYSICAL REVIEW E, 2000, 62 (03) : 4365 - 4377
[5] ALGORITHMUS 26 - ALGORITHM FOR FINDING TRANSITIVE CLOSURE OF A DIGRAPH
DZIKIEWICZ, J
COMPUTING, 1975, 15 (01) : 75 - 79
[6] AN ALGORITHM FOR FINDING ALL THE K-COMPONENTS OF A DIGRAPH
MAKINO, S
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1988, 24 (3-4) : 213 - 221
[7] ALGORITHM FOR FINDING A MINIMAL EQUIVALENT GRAPH OF A STRONGLY CONNECTED DIGRAPH
MARTELLO, S
COMPUTING, 1979, 21 (03) : 183 - 194
[8] A GPU parallel algorithm for finding a negative subset disjoint cycle in a graph
Sielski, Piotr
Corduk, Akif
Linsenmaier, Hugo
Fender, Alex
2023 IEEE HIGH PERFORMANCE EXTREME COMPUTING CONFERENCE, HPEC, 2023,
[9] ON A CYCLE FINDING ALGORITHM
LOIZOU, G
INFORMATION PROCESSING LETTERS, 1980, 11 (01) : 33 - 36
[10] Efficient Associative Algorithm for Finding the Second Simple Shortest Paths in a Digraph
Nepomniaschaya, Anna
PARALLEL COMPUTING TECHNOLOGIES, 2011, 6873 : 182 - 191

← 1 2 3 4 5 →