Matches in SemOpenAlex for { <https://semopenalex.org/work/W1543313385> ?p ?o ?g. }
Showing items 1 to 92 of
92
with 100 items per page.
- W1543313385 endingPage "238" @default.
- W1543313385 startingPage "227" @default.
- W1543313385 abstract "Given k pairs of terminals {(s 1, t 1), …, (s k , t k )} in a graph G, the min-sum k vertex-disjoint paths problem is to find a collection {Q 1, Q 2, …, Q k } of vertex-disjoint paths with minimum total length, where Q i is an s i -to-t i path between s i and t i . We consider the problem in planar graphs, where little is known about computational tractability, even in restricted cases. Kobayashi and Sommer propose a polynomial-time algorithm for k ≤ 3 in undirected planar graphs assuming all terminals are adjacent to at most two faces. Colin de Verdière and Schrijver give a polynomial-time algorithm when all the sources are on the boundary of one face and all the sinks are on the boundary of another face and ask about the existence of a polynomial-time algorithm provided all terminals are on a common face. We make progress toward Colin de Verdière and Schrijver’s open question by giving an O(kn 5) time algorithm for undirected planar graphs when {(s 1, t 1), …, (s k , t k )} are in counter-clockwise order on a common face." @default.
- W1543313385 created "2016-06-24" @default.
- W1543313385 creator A5012478921 @default.
- W1543313385 creator A5024276495 @default.
- W1543313385 creator A5024487390 @default.
- W1543313385 date "2015-01-01" @default.
- W1543313385 modified "2023-09-24" @default.
- W1543313385 title "Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs" @default.
- W1543313385 cites W100926944 @default.
- W1543313385 cites W2004779317 @default.
- W1543313385 cites W2005079828 @default.
- W1543313385 cites W2017434030 @default.
- W1543313385 cites W2041884875 @default.
- W1543313385 cites W2050579693 @default.
- W1543313385 cites W2079155561 @default.
- W1543313385 cites W2102722785 @default.
- W1543313385 cites W2569646339 @default.
- W1543313385 cites W2762935521 @default.
- W1543313385 cites W65356316 @default.
- W1543313385 doi "https://doi.org/10.1007/978-3-662-48350-3_20" @default.
- W1543313385 hasPublicationYear "2015" @default.
- W1543313385 type Work @default.
- W1543313385 sameAs 1543313385 @default.
- W1543313385 citedByCount "3" @default.
- W1543313385 countsByYear W15433133852015 @default.
- W1543313385 countsByYear W15433133852018 @default.
- W1543313385 countsByYear W15433133852019 @default.
- W1543313385 crossrefType "book-chapter" @default.
- W1543313385 hasAuthorship W1543313385A5012478921 @default.
- W1543313385 hasAuthorship W1543313385A5024276495 @default.
- W1543313385 hasAuthorship W1543313385A5024487390 @default.
- W1543313385 hasBestOaLocation W15433133852 @default.
- W1543313385 hasConcept C101837359 @default.
- W1543313385 hasConcept C114614502 @default.
- W1543313385 hasConcept C118615104 @default.
- W1543313385 hasConcept C121684516 @default.
- W1543313385 hasConcept C132525143 @default.
- W1543313385 hasConcept C134786449 @default.
- W1543313385 hasConcept C144024400 @default.
- W1543313385 hasConcept C148764684 @default.
- W1543313385 hasConcept C199360897 @default.
- W1543313385 hasConcept C22590252 @default.
- W1543313385 hasConcept C2777735758 @default.
- W1543313385 hasConcept C2779145032 @default.
- W1543313385 hasConcept C2779304628 @default.
- W1543313385 hasConcept C3018234147 @default.
- W1543313385 hasConcept C311688 @default.
- W1543313385 hasConcept C33923547 @default.
- W1543313385 hasConcept C36289849 @default.
- W1543313385 hasConcept C41008148 @default.
- W1543313385 hasConcept C45340560 @default.
- W1543313385 hasConcept C80899671 @default.
- W1543313385 hasConceptScore W1543313385C101837359 @default.
- W1543313385 hasConceptScore W1543313385C114614502 @default.
- W1543313385 hasConceptScore W1543313385C118615104 @default.
- W1543313385 hasConceptScore W1543313385C121684516 @default.
- W1543313385 hasConceptScore W1543313385C132525143 @default.
- W1543313385 hasConceptScore W1543313385C134786449 @default.
- W1543313385 hasConceptScore W1543313385C144024400 @default.
- W1543313385 hasConceptScore W1543313385C148764684 @default.
- W1543313385 hasConceptScore W1543313385C199360897 @default.
- W1543313385 hasConceptScore W1543313385C22590252 @default.
- W1543313385 hasConceptScore W1543313385C2777735758 @default.
- W1543313385 hasConceptScore W1543313385C2779145032 @default.
- W1543313385 hasConceptScore W1543313385C2779304628 @default.
- W1543313385 hasConceptScore W1543313385C3018234147 @default.
- W1543313385 hasConceptScore W1543313385C311688 @default.
- W1543313385 hasConceptScore W1543313385C33923547 @default.
- W1543313385 hasConceptScore W1543313385C36289849 @default.
- W1543313385 hasConceptScore W1543313385C41008148 @default.
- W1543313385 hasConceptScore W1543313385C45340560 @default.
- W1543313385 hasConceptScore W1543313385C80899671 @default.
- W1543313385 hasLocation W15433133851 @default.
- W1543313385 hasLocation W15433133852 @default.
- W1543313385 hasOpenAccess W1543313385 @default.
- W1543313385 hasPrimaryLocation W15433133851 @default.
- W1543313385 hasRelatedWork W1541319718 @default.
- W1543313385 hasRelatedWork W1543313385 @default.
- W1543313385 hasRelatedWork W1988500978 @default.
- W1543313385 hasRelatedWork W2037065294 @default.
- W1543313385 hasRelatedWork W2047600543 @default.
- W1543313385 hasRelatedWork W2066450989 @default.
- W1543313385 hasRelatedWork W2094140918 @default.
- W1543313385 hasRelatedWork W2950381814 @default.
- W1543313385 hasRelatedWork W2963698099 @default.
- W1543313385 hasRelatedWork W4298315624 @default.
- W1543313385 isParatext "false" @default.
- W1543313385 isRetracted "false" @default.
- W1543313385 magId "1543313385" @default.
- W1543313385 workType "book-chapter" @default.