LONGEST PATH IN A NETWORK

被引：0
|
作者：
AZPEITIA, AG
RILEY, D
机构：
来源：
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS | 1970年 / 30卷 / 03期
关键词：
D O I：
10.1016/0022-247X(70)90147-2
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：636 / &
相关论文
共 50 条
  • [31] The Longest Path Problem Is Polynomial on Interval Graphs
    Ioannidou, Kyriaki
    Mertzios, George B.
    Nikolopoulos, Stavros D.
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2009, 2009, 5734 : 403 - +
  • [32] The Longest Path Transit Function of a graph and Betweenness
    Changat, Manoj
    Narasimha-Shenoi, Prasanth G.
    Pelayo, Ignacio M.
    [J]. UTILITAS MATHEMATICA, 2010, 82 : 111 - 127
  • [33] Longest increasing path within the critical strip
    Dey, Partha S.
    Joseph, Mathew
    Peled, Ron
    [J]. ISRAEL JOURNAL OF MATHEMATICS, 2024, 262 (01) : 1 - 41
  • [34] The Longest Path Problem Is Polynomial on Cocomparability Graphs
    Ioannidou, Kyriaki
    Nikolopoulos, Stavros D.
    [J]. ALGORITHMICA, 2013, 65 (01) : 177 - 205
  • [35] LONGEST FIBER OPTIC NETWORK
    BLACKMAN, A
    [J]. FUTURIST, 1982, 16 (03) : 58 - 58
  • [36] On exact solution approaches for the longest induced path problem
    Matsypura, Dmytro
    Veremyev, Alexander
    Prokopyev, Oleg A.
    Pasiliao, Eduardo L.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 278 (02) : 546 - 562
  • [37] Optimal alignments of longest common subsequences and their path properties
    Lember, Jueri
    Matzinger, Heinrich
    Vollmer, Anna
    [J]. BERNOULLI, 2014, 20 (03) : 1292 - 1343
  • [38] An efficient parallel algorithm for the longest path problem in meshes
    Keshavarz-Kohjerdi, Fatemeh
    Bagheri, Alireza
    [J]. JOURNAL OF SUPERCOMPUTING, 2013, 65 (02): : 723 - 741
  • [39] Finding a longest nonnegative path in a constant degree tree
    Kim, SK
    [J]. INFORMATION PROCESSING LETTERS, 2005, 93 (06) : 275 - 279
  • [40] Integral flow decomposition with minimum longest path length
    Pienkosz, Krzysztof
    Koltys, Kamil
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 247 (02) : 414 - 420
12345