Linkage on the infinite grid.
Saved in:
| Title: | Linkage on the infinite grid. |
|---|---|
| Authors: | Jobson, Adam S.1 adam.jobson@louisville.edu, Kézdy, André E.1 andre.kezdy@louisville.edu, Lehel, Jenő1,2 j0lehe01@louisville.edu |
| Source: | Information Processing Letters. Sep2018, Vol. 137, p51-56. 6p. |
| Subjects: | Paired comparisons (Mathematics), Taxicab geometry, Geometric vertices, Angles, Euclidean distance, Euclidean domains |
| Abstract: | For k fixed, a graph G is k-path-pairable , if for any set of k disjoint pairs of vertices, s i , t i , 1 ≤ i ≤ k , there exist pairwise edge-disjoint s i , t i -paths in G . Bounds on path-pairability are given here if G is the graph of the infinite integer grid in the Euclidean plane (vertices of G are the points of integer coordinates and two vertices are adjacent if and only if their Manhattan distance is 1). We prove that G is 10-path-pairable and at most 14-path-pairable. Related results and conjectures are summarized also for the integer halfplane, for the positive integer quadrant and for finite grids. [ABSTRACT FROM AUTHOR] |
| Copyright of Information Processing Letters is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 129946551 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Linkage on the infinite grid. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Jobson%2C+Adam+S%2E%22">Jobson, Adam S.</searchLink><relatesTo>1</relatesTo><i> adam.jobson@louisville.edu</i><br /><searchLink fieldCode="AR" term="%22Kézdy%2C+André+E%2E%22">Kézdy, André E.</searchLink><relatesTo>1</relatesTo><i> andre.kezdy@louisville.edu</i><br /><searchLink fieldCode="AR" term="%22Lehel%2C+Jenő%22">Lehel, Jenő</searchLink><relatesTo>1,2</relatesTo><i> j0lehe01@louisville.edu</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Information+Processing+Letters%22">Information Processing Letters</searchLink>. Sep2018, Vol. 137, p51-56. 6p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Paired+comparisons+%28Mathematics%29%22">Paired comparisons (Mathematics)</searchLink><br /><searchLink fieldCode="DE" term="%22Taxicab+geometry%22">Taxicab geometry</searchLink><br /><searchLink fieldCode="DE" term="%22Geometric+vertices%22">Geometric vertices</searchLink><br /><searchLink fieldCode="DE" term="%22Angles%22">Angles</searchLink><br /><searchLink fieldCode="DE" term="%22Euclidean+distance%22">Euclidean distance</searchLink><br /><searchLink fieldCode="DE" term="%22Euclidean+domains%22">Euclidean domains</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: For k fixed, a graph G is k-path-pairable , if for any set of k disjoint pairs of vertices, s i , t i , 1 ≤ i ≤ k , there exist pairwise edge-disjoint s i , t i -paths in G . Bounds on path-pairability are given here if G is the graph of the infinite integer grid in the Euclidean plane (vertices of G are the points of integer coordinates and two vertices are adjacent if and only if their Manhattan distance is 1). We prove that G is 10-path-pairable and at most 14-path-pairable. Related results and conjectures are summarized also for the integer halfplane, for the positive integer quadrant and for finite grids. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Information Processing Letters is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=129946551 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1016/j.ipl.2018.05.001 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 6 StartPage: 51 Subjects: – SubjectFull: Paired comparisons (Mathematics) Type: general – SubjectFull: Taxicab geometry Type: general – SubjectFull: Geometric vertices Type: general – SubjectFull: Angles Type: general – SubjectFull: Euclidean distance Type: general – SubjectFull: Euclidean domains Type: general Titles: – TitleFull: Linkage on the infinite grid. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Jobson, Adam S. – PersonEntity: Name: NameFull: Kézdy, André E. – PersonEntity: Name: NameFull: Lehel, Jenő IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 09 Text: Sep2018 Type: published Y: 2018 Identifiers: – Type: issn-print Value: 00200190 Numbering: – Type: volume Value: 137 Titles: – TitleFull: Information Processing Letters Type: main |
| ResultId | 1 |
