Matches in SemOpenAlex for { <https://semopenalex.org/work/W4287181997> ?p ?o ?g. }
Showing items 1 to 59 of
59
with 100 items per page.
- W4287181997 abstract "The well-known Disjoint Paths problem is to decide if a graph contains k pairwise disjoint paths, each connecting a different terminal pair from a set of k distinct pairs. We determine, with an exception of two cases, the complexity of the Disjoint Paths problem for $H$-free graphs. If $k$ is fixed, we obtain the $k$-Disjoint Paths problem, which is known to be polynomial-time solvable on the class of all graphs for every $k geq 1$. The latter does no longer hold if we need to connect vertices from terminal sets instead of terminal pairs. We completely classify the complexity of $k$-Disjoint Connected Subgraphs for $H$-free graphs, and give the same almost-complete classification for Disjoint Connected Subgraphs for $H$-free graphs as for Disjoint Paths." @default.
- W4287181997 created "2022-07-25" @default.
- W4287181997 creator A5003084202 @default.
- W4287181997 creator A5013230954 @default.
- W4287181997 creator A5027487467 @default.
- W4287181997 creator A5041371022 @default.
- W4287181997 creator A5056030509 @default.
- W4287181997 date "2021-05-13" @default.
- W4287181997 modified "2023-09-23" @default.
- W4287181997 title "Disjoint Paths and Connected Subgraphs for H-Free Graphs" @default.
- W4287181997 doi "https://doi.org/10.48550/arxiv.2105.06349" @default.
- W4287181997 hasPublicationYear "2021" @default.
- W4287181997 type Work @default.
- W4287181997 citedByCount "0" @default.
- W4287181997 crossrefType "posted-content" @default.
- W4287181997 hasAuthorship W4287181997A5003084202 @default.
- W4287181997 hasAuthorship W4287181997A5013230954 @default.
- W4287181997 hasAuthorship W4287181997A5027487467 @default.
- W4287181997 hasAuthorship W4287181997A5041371022 @default.
- W4287181997 hasAuthorship W4287181997A5056030509 @default.
- W4287181997 hasBestOaLocation W42871819971 @default.
- W4287181997 hasConcept C102192266 @default.
- W4287181997 hasConcept C105795698 @default.
- W4287181997 hasConcept C114614502 @default.
- W4287181997 hasConcept C118615104 @default.
- W4287181997 hasConcept C132525143 @default.
- W4287181997 hasConcept C160446614 @default.
- W4287181997 hasConcept C184898388 @default.
- W4287181997 hasConcept C311688 @default.
- W4287181997 hasConcept C33923547 @default.
- W4287181997 hasConcept C45340560 @default.
- W4287181997 hasConcept C59824394 @default.
- W4287181997 hasConceptScore W4287181997C102192266 @default.
- W4287181997 hasConceptScore W4287181997C105795698 @default.
- W4287181997 hasConceptScore W4287181997C114614502 @default.
- W4287181997 hasConceptScore W4287181997C118615104 @default.
- W4287181997 hasConceptScore W4287181997C132525143 @default.
- W4287181997 hasConceptScore W4287181997C160446614 @default.
- W4287181997 hasConceptScore W4287181997C184898388 @default.
- W4287181997 hasConceptScore W4287181997C311688 @default.
- W4287181997 hasConceptScore W4287181997C33923547 @default.
- W4287181997 hasConceptScore W4287181997C45340560 @default.
- W4287181997 hasConceptScore W4287181997C59824394 @default.
- W4287181997 hasLocation W42871819971 @default.
- W4287181997 hasOpenAccess W4287181997 @default.
- W4287181997 hasPrimaryLocation W42871819971 @default.
- W4287181997 hasRelatedWork W2015236004 @default.
- W4287181997 hasRelatedWork W2022054586 @default.
- W4287181997 hasRelatedWork W2044393195 @default.
- W4287181997 hasRelatedWork W2079861814 @default.
- W4287181997 hasRelatedWork W2109121075 @default.
- W4287181997 hasRelatedWork W2152478214 @default.
- W4287181997 hasRelatedWork W2949534545 @default.
- W4287181997 hasRelatedWork W3160792420 @default.
- W4287181997 hasRelatedWork W3168725788 @default.
- W4287181997 hasRelatedWork W3209626956 @default.
- W4287181997 isParatext "false" @default.
- W4287181997 isRetracted "false" @default.
- W4287181997 workType "article" @default.