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 条
  • [21] Very fast algorithm for barrier options
    Dai, Tian-Shyr
    Lyuu, Yuh-Dauh
    WMSCI 2006: 10TH WORLD MULTI-CONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL VI, PROCEEDINGS, 2006, : 306 - +
  • [22] A very fast algorithm for matrix factorization
    Nikulin, Vladimir
    Huang, Tian-Hsiang
    Ng, Shu-Kay
    Rathnayake, Suren I.
    McLachlan, Geoffrey J.
    STATISTICS & PROBABILITY LETTERS, 2011, 81 (07) : 773 - 782
  • [23] A VERY FAST SUBSTRING SEARCH ALGORITHM
    SUNDAY, DM
    COMMUNICATIONS OF THE ACM, 1990, 33 (08) : 132 - 142
  • [24] A CONTRACTION ALGORITHM FOR FINDING SMALL CYCLE CUTSETS
    LEVY, H
    LOW, DW
    JOURNAL OF ALGORITHMS, 1988, 9 (04) : 470 - 493
  • [25] SIMPLE ALGORITHM FOR FINDING A SECOND HAMILTON CYCLE
    Jensen, Tommy R.
    SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2012, 9 : 151 - 155
  • [26] FAST ALGORITHM FOR FINDING A FOREST OF A LINEAR GRAPH
    JOVANOVICH, AD
    CHOBELJICH, SN
    ELECTRONICS LETTERS, 1973, 9 (21) : 504 - 505
  • [27] A fast maximum finding algorithm on broadcast communication
    Shiau, SH
    Yang, CB
    COMPUTING AND COMBINATORICS, 1995, 959 : 472 - 481
  • [28] A fast maximum finding algorithm on broadcast communication
    Shiau, SH
    Yang, CB
    INFORMATION PROCESSING LETTERS, 1996, 60 (02) : 81 - 89
  • [29] A fast finding and fitting algorithm to detect circles
    Yi, W
    IGARSS '98 - 1998 INTERNATIONAL GEOSCIENCE AND REMOTE SENSING SYMPOSIUM, PROCEEDINGS VOLS 1-5: SENSING AND MANAGING THE ENVIRONMENT, 1998, : 1187 - 1189
  • [30] A FAST ALGORITHM FOR FINDING ALL SHORTEST PATHS
    WATANABE, O
    INFORMATION PROCESSING LETTERS, 1981, 13 (01) : 1 - 3
12345