An Algorithm for Finding Two Edge-Disjoint Paths in Tournaments

12 References
  • NAKAYAMA Shin-ichi
    the Department of Mathematical Sciences, Faculty of Integrated Arts and Sciences, The University of Tokushima
  • MASUYAMA Shigeru
    the Department of Knowledge-Based Information Engineering, Toyohashi University of Technology

Search this article

Abstract

This paper presents an O(n^2)-time algorithm for constructing two edge-disjoint paths connecting two given pairs of vertices in a given tournament graph. It improves the time complexity of a previously known O(n^4)-time algorithm.

Journal

References(12)*help

See more

Keywords

Details 詳細情報について

  • CRID
    1570291227426560512
  • NII Article ID
    110003208518
  • NII Book ID
    AA10826239
  • ISSN
    09168508
  • Text Lang
    en
  • Data Source
    • CiNii Articles

Report a problem

Back to top