Matches in SemOpenAlex for { <https://semopenalex.org/work/W4232709711> ?p ?o ?g. }
Showing items 1 to 83 of
83
with 100 items per page.
- W4232709711 endingPage "171" @default.
- W4232709711 startingPage "160" @default.
- W4232709711 abstract "The Surjective Homomorphism problem is to test whether a given graph G called the guest graph allows a vertex-surjective homomorphism to some other given graph H called the host graph. The bijective and injective homomorphism problems can be formulated in terms of spanning subgraphs and subgraphs, and as such their computational complexity has been extensively studied. What about the surjective variant? Because this problem is NP-complete in general, we restrict the guest and the host graph to belong to graph classes ${cal G}$ and ${cal H}$ , respectively. We determine to what extent a certain choice of ${cal G}$ and ${cal H}$ influences its computational complexity. We observe that the problem is polynomial-time solvable if ${cal H}$ is the class of paths, whereas it is NP-complete if ${cal G}$ is the class of paths. Moreover, we show that the problem is even NP-complete on many other elementary graph classes, namely linear forests, unions of complete graphs, cographs, proper interval graphs, split graphs and trees of pathwidth at most 2. In contrast, we prove that the problem is fixed-parameter tractable in k if ${cal G}$ is the class of trees and ${cal H}$ is the class of trees with at most k leaves, or if ${cal G}$ and ${cal H}$ are equal to the class of graphs with vertex cover number at most k." @default.
- W4232709711 created "2022-05-12" @default.
- W4232709711 creator A5013230954 @default.
- W4232709711 creator A5027487467 @default.
- W4232709711 creator A5051709720 @default.
- W4232709711 creator A5052932128 @default.
- W4232709711 date "2012-01-01" @default.
- W4232709711 modified "2023-10-18" @default.
- W4232709711 title "Finding Vertex-Surjective Graph Homomorphisms" @default.
- W4232709711 cites W1485295947 @default.
- W4232709711 cites W1556562107 @default.
- W4232709711 cites W1559081432 @default.
- W4232709711 cites W1565047086 @default.
- W4232709711 cites W171389261 @default.
- W4232709711 cites W1795713683 @default.
- W4232709711 cites W1818782719 @default.
- W4232709711 cites W1975912662 @default.
- W4232709711 cites W1983788780 @default.
- W4232709711 cites W1993328543 @default.
- W4232709711 cites W2033649868 @default.
- W4232709711 cites W2039709665 @default.
- W4232709711 cites W2051028069 @default.
- W4232709711 cites W2077575555 @default.
- W4232709711 cites W2090960684 @default.
- W4232709711 cites W2094346430 @default.
- W4232709711 cites W2103715966 @default.
- W4232709711 cites W2111829945 @default.
- W4232709711 cites W2112553449 @default.
- W4232709711 cites W2114616381 @default.
- W4232709711 cites W655258421 @default.
- W4232709711 doi "https://doi.org/10.1007/978-3-642-30642-6_16" @default.
- W4232709711 hasPublicationYear "2012" @default.
- W4232709711 type Work @default.
- W4232709711 citedByCount "3" @default.
- W4232709711 countsByYear W42327097112012 @default.
- W4232709711 crossrefType "book-chapter" @default.
- W4232709711 hasAuthorship W4232709711A5013230954 @default.
- W4232709711 hasAuthorship W4232709711A5027487467 @default.
- W4232709711 hasAuthorship W4232709711A5051709720 @default.
- W4232709711 hasAuthorship W4232709711A5052932128 @default.
- W4232709711 hasBestOaLocation W42327097112 @default.
- W4232709711 hasConcept C114614502 @default.
- W4232709711 hasConcept C118615104 @default.
- W4232709711 hasConcept C119238805 @default.
- W4232709711 hasConcept C128107574 @default.
- W4232709711 hasConcept C132525143 @default.
- W4232709711 hasConcept C149530733 @default.
- W4232709711 hasConcept C203776342 @default.
- W4232709711 hasConcept C33923547 @default.
- W4232709711 hasConcept C4042151 @default.
- W4232709711 hasConcept C7036158 @default.
- W4232709711 hasConceptScore W4232709711C114614502 @default.
- W4232709711 hasConceptScore W4232709711C118615104 @default.
- W4232709711 hasConceptScore W4232709711C119238805 @default.
- W4232709711 hasConceptScore W4232709711C128107574 @default.
- W4232709711 hasConceptScore W4232709711C132525143 @default.
- W4232709711 hasConceptScore W4232709711C149530733 @default.
- W4232709711 hasConceptScore W4232709711C203776342 @default.
- W4232709711 hasConceptScore W4232709711C33923547 @default.
- W4232709711 hasConceptScore W4232709711C4042151 @default.
- W4232709711 hasConceptScore W4232709711C7036158 @default.
- W4232709711 hasLocation W42327097111 @default.
- W4232709711 hasLocation W42327097112 @default.
- W4232709711 hasLocation W42327097113 @default.
- W4232709711 hasLocation W42327097114 @default.
- W4232709711 hasLocation W42327097115 @default.
- W4232709711 hasOpenAccess W4232709711 @default.
- W4232709711 hasPrimaryLocation W42327097111 @default.
- W4232709711 hasRelatedWork W1609919256 @default.
- W4232709711 hasRelatedWork W1974184976 @default.
- W4232709711 hasRelatedWork W2083020053 @default.
- W4232709711 hasRelatedWork W2286480406 @default.
- W4232709711 hasRelatedWork W2521976240 @default.
- W4232709711 hasRelatedWork W2537038771 @default.
- W4232709711 hasRelatedWork W2761085110 @default.
- W4232709711 hasRelatedWork W2951142075 @default.
- W4232709711 hasRelatedWork W2974321649 @default.
- W4232709711 hasRelatedWork W3101124545 @default.
- W4232709711 isParatext "false" @default.
- W4232709711 isRetracted "false" @default.
- W4232709711 workType "book-chapter" @default.