Hiindex LOGO

Research Article

2 Disjoint Paths Problem in Oriented Mesh Network


Author(s): Antony Xavier , Florence Isido. D,V.M.Chitra
Affiliation: Department of Mathematics, Loyola College, Chennai, India
Year of Publication: 2014
Source: International Journal of Computing Algorithm
     
×

Scholarly Article Identity Link


HTML:

<a href="http://www.hindex.org/2014/article.php?page=572"><img src="http://www.hindex.org/sai.php/2014SCIA316F0572" alt="SAI"></a>


File:

http://www.hindex.org/2014/p572.pdf


Citation: Antony Xavier, Florence Isido. D,V.M.Chitra. "2 Disjoint Paths Problem in Oriented Mesh Network." International Journal of Computing Algorithm 3.1 (2014): 1-4.

Abstract:
Given a graph G = (V,E) and two distinct pairs of vertices and the 2- DPP is to find two disjoint paths from to and from to .In this paper we define orientation in the mesh and identify the pairs of vertices in which 2 DPP is not solvable.


Keywords 2-V DPP,graph


  • BibTex
  • Reference
  • XML
  • JSON
  • Dublin Core
  • CSL

@article{2Di1457214, author = {Antony Xavier,Florence Isido. D,V.M.Chitra}, title = {2 Disjoint Paths Problem in Oriented Mesh Network}, journal={International Journal of Computing Algorithm}, volume={3}, issue={1}, issn = {2278-2397}, year = {2014}, publisher = {Scholarly Citation Index Analytics-SCIA}

  • [1] Even S, Itai A and.Shamir A, On the Complexity of timetable and multicommodity flow problems, SIAM Journal of computation, 5, (1976), 691-703.
  • [2] Fortune S, Hopcroft J.E. and Wyllie J. , The directed subgraph homeomorphism problem, Theoretical Computer Science,10, (1980), 111- 121
  • [3] Kobayashi Y. and. Sommer C, On shortest disjoint paths in planar graphs,Discrete Optimization, 7, 2010, 243-245.
  • [4] Khuller S. Mitchell S. G and Vazirani V. V., Processor efficient parallelalgorithms for the two disjoint paths problem and for finding a Kuratowskihomeomorph, SIAM Journal of Computation, 21, (1992), 486- 506.
  • [5] Lynch J. F, The equivalence of theorem proving and the interconnectionproblem, (ACM) SIGDA Networks, 5 (1975), 31-36.
  • [6] Ohtsuki T, The two disjoint path problem and wire routing design, Proc.Symposium on Graph Theory and Algorithms, Lecture Notes in Computer Science, 108, Springer, Berlin, (1981), 207-216.
  • [7] Perl Y and. Shiloach Y, Finding two disjoint paths between two pairs ofvertices in a graph, Journal of Association for Computing Machinery, 25,(1978), 1-9.
  • [8] Ripphausen-Lipa, H. Wagner D andWeihe K, Combinatorial optimization papers from the DIMACS Special Y ear, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 20, (1995), 295-354.
  • [9] Robertson N and Seymour P. D., Graph minors: XIII: The disjoint paths problem, Journal of Combinatorial Theory, Ser. B, 63, (1995), 65-110.
  • [10] Schrijver A., Finding k disjoint paths in a directed planar graph, SIAM Journal of Computation, 23, (1994), 780-788.
  • [11] Woeginger G, A simple solution to the two paths problem in planar graphs, Information Processing Letters, 36, (1990),191- 192.

  • <?xml version='1.0' encoding='UTF-8'?> <record> <language>eng</language> <journalTitle>International Journal of Computing Algorithm</journalTitle> <eissn>2278-2397 </eissn> <publicationDate>2014</publicationDate> <volume>3</volume> <issue>1</issue> <startPage>1</startPage> <endPage>4</endPage> <documentType>article</documentType> <title language='eng'>2 Disjoint Paths Problem in Oriented Mesh Network</title> <authors> <author> <name>Antony Xavier</name> </author> </authors> <abstract language='eng'>Given a graph G = (V,E) and two distinct pairs of vertices and the 2- DPP is to find two disjoint paths from to and from to .In this paper we define orientation in the mesh and identify the pairs of vertices in which 2 DPP is not solvable.</abstract> <fullTextUrl format='pdf'>http://www.hindex.org/2014/p572.pdf</fullTextUrl> <keywords language='eng'> <keyword>2-V DPP,graph</keyword> </keywords> </record>

    { "@context":"http://schema.org", "@type":"publication-article","identifier":"http://www.hindex.org/2014/article.php?page=572", "name":"2 Disjoint Paths Problem in Oriented Mesh Network", "author":[{"name":"Antony Xavier "}], "datePublished":"2014", "description":"Given a graph G = (V,E) and two distinct pairs of vertices and the 2- DPP is to find two disjoint paths from to and from to .In this paper we define orientation in the mesh and identify the pairs of vertices in which 2 DPP is not solvable.", "keywords":["2-V DPP,graph"], "schemaVersion":"https://schema.org/version/3.3", "includedInDataCatalog":{ "@type":"DataCatalog", "name":"Scholarly Citation Index Analytics-SCIA", "url":"http://hindex.org"}, "publisher":{"@type":"Organization", "name":"Scientific Communications Research Academy" } }

    <?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"> <dc:contributor>Florence Isido. D</dc:contributor> <dc:contributor>V.M.Chitra</dc:contributor> <dc:contributor></dc:contributor> <dc:creator>Antony Xavier</dc:creator> <dc:date>2014</dc:date> <dc:description>Given a graph G = (V,E) and two distinct pairs of vertices and the 2- DPP is to find two disjoint paths from to and from to .In this paper we define orientation in the mesh and identify the pairs of vertices in which 2 DPP is not solvable.</dc:description> <dc:identifier>2014SCIA316F0572</dc:identifier> <dc:language>eng</dc:language> <dc:title>2 Disjoint Paths Problem in Oriented Mesh Network</dc:title> <dc:type>publication-article</dc:type> </oai_dc:dc>

    { "identifier": "2014SCIA316F0572", "abstract": "Given a graph G = (V,E) and two distinct pairs of vertices and the 2- DPP is to find two disjoint paths from to and from to .In this paper we define orientation in the mesh and identify the pairs of vertices in which 2 DPP is not solvable.", "author": [ { "family": "Antony Xavier,Florence Isido. D,V.M.Chitra" } ], "id": "572", "issued": { "date-parts": [ [ 2014 ] ] }, "language": "eng", "publisher": "Scholarly Citation Index Analytics-SCIA", "title": " 2 Disjoint Paths Problem in Oriented Mesh Network", "type": "publication-article", "version": "3" }