Matches in SemOpenAlex for { <https://semopenalex.org/work/W2802244013> ?p ?o ?g. }
Showing items 1 to 72 of
72
with 100 items per page.
- W2802244013 endingPage "127" @default.
- W2802244013 startingPage "116" @default.
- W2802244013 abstract "For a (possibly infinite) fixed family of graphs $$mathcal {F}$$ , we say that a graph G overlays $$mathcal {F}$$ on a hypergraph H if V(H) is equal to V(G) and the subgraph of G induced by every hyperedge of H contains some member of $$mathcal {F}$$ as a spanning subgraph. While it is easy to see that the complete graph on |V(H)| overlays $$mathcal {F}$$ on a hypergraph H whenever the problem admits a solution, the Minimum $$mathcal {F}$$ -Overlay problem asks for such a graph with the minimum number of edges. This problem allows to generalize some natural problems which may arise in practice. For instance, if the family $$mathcal {F}$$ contains all connected graphs, then Minimum $$mathcal {F}$$ -Overlay corresponds to the Minimum Connectivity Inference problem (also known as Subset Interconnection Design problem) introduced for the low-resolution reconstruction of macro-molecular assembly in structural biology, or for the design of networks. Our main contribution is a strong dichotomy result regarding the polynomial vs. NP-hard status with respect to the considered family $$mathcal {F}$$ . Roughly speaking, we show that the easy cases one can think of (e.g. when edgeless graphs of the right sizes are in $$mathcal {F}$$ , or if $$mathcal {F}$$ contains only cliques) are the only families giving rise to a polynomial problem: all others are NP-complete. We then investigate the parameterized complexity of the problem and give similar sufficient conditions on $$mathcal {F}$$ that give rise to $$mathsf{W} [1]$$ -hard, $$mathsf{W} [2]$$ -hard or $$mathsf{FPT} $$ problems when the parameter is the size of the solution. This yields an FPT/ $$mathsf{W} [1]$$ -hard dichotomy for a relaxed problem, where every hyperedge of H must contain some member of $$mathcal {F}$$ as a (non necessarily spanning) subgraph." @default.
- W2802244013 created "2018-05-17" @default.
- W2802244013 creator A5001897583 @default.
- W2802244013 creator A5025941213 @default.
- W2802244013 creator A5031575825 @default.
- W2802244013 creator A5032236926 @default.
- W2802244013 creator A5067914789 @default.
- W2802244013 date "2018-01-01" @default.
- W2802244013 modified "2023-09-25" @default.
- W2802244013 title "Complexity Dichotomies for the Minimum $$mathcal {F}$$-Overlay Problem" @default.
- W2802244013 cites W1580460466 @default.
- W2802244013 cites W1787635289 @default.
- W2802244013 cites W1969940463 @default.
- W2802244013 cites W2049693545 @default.
- W2802244013 cites W2050339304 @default.
- W2802244013 cites W2058702473 @default.
- W2802244013 cites W2080022329 @default.
- W2802244013 cites W2116087731 @default.
- W2802244013 cites W2124124285 @default.
- W2802244013 cites W2130739699 @default.
- W2802244013 cites W2153718046 @default.
- W2802244013 cites W22994886 @default.
- W2802244013 cites W2802244013 @default.
- W2802244013 cites W381489330 @default.
- W2802244013 cites W4245608944 @default.
- W2802244013 doi "https://doi.org/10.1007/978-3-319-78825-8_10" @default.
- W2802244013 hasPublicationYear "2018" @default.
- W2802244013 type Work @default.
- W2802244013 sameAs 2802244013 @default.
- W2802244013 citedByCount "1" @default.
- W2802244013 countsByYear W28022440132018 @default.
- W2802244013 crossrefType "book-chapter" @default.
- W2802244013 hasAuthorship W2802244013A5001897583 @default.
- W2802244013 hasAuthorship W2802244013A5025941213 @default.
- W2802244013 hasAuthorship W2802244013A5031575825 @default.
- W2802244013 hasAuthorship W2802244013A5032236926 @default.
- W2802244013 hasAuthorship W2802244013A5067914789 @default.
- W2802244013 hasBestOaLocation W28022440132 @default.
- W2802244013 hasConcept C114614502 @default.
- W2802244013 hasConcept C118615104 @default.
- W2802244013 hasConcept C132525143 @default.
- W2802244013 hasConcept C165464430 @default.
- W2802244013 hasConcept C2781221856 @default.
- W2802244013 hasConcept C33923547 @default.
- W2802244013 hasConceptScore W2802244013C114614502 @default.
- W2802244013 hasConceptScore W2802244013C118615104 @default.
- W2802244013 hasConceptScore W2802244013C132525143 @default.
- W2802244013 hasConceptScore W2802244013C165464430 @default.
- W2802244013 hasConceptScore W2802244013C2781221856 @default.
- W2802244013 hasConceptScore W2802244013C33923547 @default.
- W2802244013 hasLocation W28022440131 @default.
- W2802244013 hasLocation W28022440132 @default.
- W2802244013 hasLocation W28022440133 @default.
- W2802244013 hasLocation W28022440134 @default.
- W2802244013 hasOpenAccess W2802244013 @default.
- W2802244013 hasPrimaryLocation W28022440131 @default.
- W2802244013 hasRelatedWork W2085440561 @default.
- W2802244013 hasRelatedWork W2181694489 @default.
- W2802244013 hasRelatedWork W2224556402 @default.
- W2802244013 hasRelatedWork W2549678560 @default.
- W2802244013 hasRelatedWork W2963168358 @default.
- W2802244013 hasRelatedWork W3006382266 @default.
- W2802244013 hasRelatedWork W3211008162 @default.
- W2802244013 hasRelatedWork W4286889298 @default.
- W2802244013 hasRelatedWork W4287867392 @default.
- W2802244013 hasRelatedWork W4297781165 @default.
- W2802244013 isParatext "false" @default.
- W2802244013 isRetracted "false" @default.
- W2802244013 magId "2802244013" @default.
- W2802244013 workType "book-chapter" @default.