• DocumentCode
    2181679
  • Title

    Shortest path problems in planar graphs

  • Author

    Frederickson, Greg N.

  • fYear
    1983
  • fDate
    7-9 Nov. 1983
  • Firstpage
    242
  • Lastpage
    247
  • Abstract
    Graph decomposition and data structures techniques are presented that make possible faster algorithms for shortest paths in planar graphs. Improved algorithms are presented for the single source problem, the all pairs problem, and the problem of finding a minimum cut in an undirected graph.
  • Keywords
    Character generation; Costs; Data structures; Iterative algorithms; Particle separators; Partitioning algorithms; Shortest path problem;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1983., 24th Annual Symposium on
  • Conference_Location
    Tucson, AZ, USA
  • ISSN
    0272-5428
  • Print_ISBN
    0-8186-0508-1
  • Type

    conf

  • DOI
    10.1109/SFCS.1983.69
  • Filename
    4568084
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2181679