Repository logo
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    or
    New user? Click here to register.Have you forgotten your password?
Repository logo
  • Communities & Collections
  • Research Outputs
  • Fundings & Projects
  • People
  • Statistics
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    or
    New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Indian Institute of Technology Madras
  3. Publication12
  4. A new linear algorithm for the two path problem on chordal graphs
 
  • Details
Options

A new linear algorithm for the two path problem on chordal graphs

Date Issued
01-01-1988
Author(s)
Krishnan, S. V.
C Pandu Rangan 
Indian Institute of Technology, Madras
Seshadri, S.
DOI
10.1007/3-540-50517-2_70
Abstract
Let G= (V,E) be a finite undirected graph with four distinguished vertices s, t, u, v. The two path problem (TPP) is to determine whether there exist two vertex disjoint paths connecting s with t and u with v and to find such paths if they exist. In this paper, a simple and efficient algorithm for TPP restricted to 2-connected chordal graphs is given. The reduction of TPP for a general chordal graph to the TPP for a 2-connected chordal graph is outlined.
Volume
338 LNCS
Indian Institute of Technology Madras Knowledge Repository developed and maintained by the Library

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback