On Approximating the Longest Path in a Graph

被引：0
|
作者：
Department of Computer Science, Stanford University, Stanford, CA 94305, United States [1 ]
机构：
来源：
Algorithmica (New York) | / 1卷 / 82-98期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] On approximating the longest path in a graph
    D. Karger
    R. Motwani
    G. D. S. Ramkumar
    Algorithmica, 1997, 18 : 82 - 98
  • [2] On approximating the longest path in a graph
    Karger, D
    Motwani, R
    Ramkumar, GDS
    ALGORITHMICA, 1997, 18 (01) : 82 - 98
  • [3] THE LONGEST PATH IN A RANDOM GRAPH
    AJTAI, M
    KOMLOS, J
    SZEMEREDI, E
    COMBINATORICA, 1981, 1 (01) : 1 - 12
  • [4] ON THE LONGEST PATH IN A RECURSIVELY PARTITIONABLE GRAPH
    Bensmail, Julien
    OPUSCULA MATHEMATICA, 2013, 33 (04) : 631 - 640
  • [5] A Study of Genetic Algorithms for Approximating the Longest Path in Generic Graphs
    Portugal, David
    Antunes, Carlos Henggeler
    Rocha, Rui
    IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC 2010), 2010,
  • [6] The Longest Path Transit Function of a graph and Betweenness
    Changat, Manoj
    Narasimha-Shenoi, Prasanth G.
    Pelayo, Ignacio M.
    UTILITAS MATHEMATICA, 2010, 82 : 111 - 127
  • [7] The Longest Minimum-Weight Path in a Complete Graph
    Addario-Berry, Louigi
    Broutin, Nicolas
    Lugosi, Gabor
    COMBINATORICS PROBABILITY & COMPUTING, 2010, 19 (01): : 1 - 19
  • [8] Approximating the longest path length of a stochastic DAG by a normal distribution in linear time
    Ando, Ei
    Nakata, Toshio
    Yamashita, Masafumi
    JOURNAL OF DISCRETE ALGORITHMS, 2009, 7 (04) : 420 - 438
  • [9] MINIMAX EQUALITY RELATED TO LONGEST DIRECTED PATH IN AN ACYCLIC GRAPH
    VIDYASANKAR, K
    YOUNGER, DH
    CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1975, 27 (02): : 348 - 351
  • [10] A note on the complexity of longest path problems related to graph coloring
    Pardalos, PM
    Migdalas, A
    APPLIED MATHEMATICS LETTERS, 2004, 17 (01) : 13 - 15
12345