Matches in SemOpenAlex for { <https://semopenalex.org/work/W4287256985> ?p ?o ?g. }
Showing items 1 to 65 of
65
with 100 items per page.
- W4287256985 abstract "We introduce the Multicolored Graph Realization problem (MGRP). The input to the problem is a colored graph $(G,varphi)$, i.e., a graph together with a coloring on its vertices. We can associate to each colored graph a cluster graph ($G_varphi)$ in which, after collapsing to a node all vertices with the same color, we remove multiple edges and self-loops. A set of vertices $S$ is multicolored when $S$ has exactly one vertex from each color class. The problem is to decide whether there is a multicolored set $S$ such that, after identifying each vertex in $S$ with its color class, $G[S]$ coincides with $G_varphi$. The MGR problem is related to the class of generalized network problems, most of which are NP-hard. For example the generalized MST problem. MGRP is a generalization of the Multicolored Clique Problem, which is known to be W[1]-hard when parameterized by the number of colors. Thus MGRP remains W[1]-hard, when parameterized by the size of the cluster graph and when parameterized by any graph parameter on $G_varphi$, among those for treewidth. We look to instances of the problem in which both the number of color classes and the treewidth of $G_varphi$ are unbounded. We show that MGRP is NP-complete when $G_varphi$ is either chordal, biconvex bipartite, complete bipartite or a 2-dimensional grid. Our hardness results follows from suitable reductions from the 1-in-3 monotone SAT problem. Our reductions show that the problem remains hard even when the maximum number of vertices in a color class is 3. In the case of the grid, the hardness holds also graphs with bounded degree. We complement those results by showing combined parameterizations under which the MGR problem became tractable." @default.
- W4287256985 created "2022-07-25" @default.
- W4287256985 creator A5033912650 @default.
- W4287256985 creator A5037690759 @default.
- W4287256985 creator A5053370998 @default.
- W4287256985 creator A5063949199 @default.
- W4287256985 date "2021-03-23" @default.
- W4287256985 modified "2023-10-16" @default.
- W4287256985 title "The Multicolored Graph Realization Problem" @default.
- W4287256985 doi "https://doi.org/10.48550/arxiv.2103.12899" @default.
- W4287256985 hasPublicationYear "2021" @default.
- W4287256985 type Work @default.
- W4287256985 citedByCount "0" @default.
- W4287256985 crossrefType "posted-content" @default.
- W4287256985 hasAuthorship W4287256985A5033912650 @default.
- W4287256985 hasAuthorship W4287256985A5037690759 @default.
- W4287256985 hasAuthorship W4287256985A5053370998 @default.
- W4287256985 hasAuthorship W4287256985A5063949199 @default.
- W4287256985 hasBestOaLocation W42872569851 @default.
- W4287256985 hasConcept C114614502 @default.
- W4287256985 hasConcept C118615104 @default.
- W4287256985 hasConcept C132525143 @default.
- W4287256985 hasConcept C132569581 @default.
- W4287256985 hasConcept C149530733 @default.
- W4287256985 hasConcept C158319403 @default.
- W4287256985 hasConcept C159985019 @default.
- W4287256985 hasConcept C165464430 @default.
- W4287256985 hasConcept C192562407 @default.
- W4287256985 hasConcept C197657726 @default.
- W4287256985 hasConcept C203776342 @default.
- W4287256985 hasConcept C2778307483 @default.
- W4287256985 hasConcept C33923547 @default.
- W4287256985 hasConcept C43517604 @default.
- W4287256985 hasConcept C80899671 @default.
- W4287256985 hasConceptScore W4287256985C114614502 @default.
- W4287256985 hasConceptScore W4287256985C118615104 @default.
- W4287256985 hasConceptScore W4287256985C132525143 @default.
- W4287256985 hasConceptScore W4287256985C132569581 @default.
- W4287256985 hasConceptScore W4287256985C149530733 @default.
- W4287256985 hasConceptScore W4287256985C158319403 @default.
- W4287256985 hasConceptScore W4287256985C159985019 @default.
- W4287256985 hasConceptScore W4287256985C165464430 @default.
- W4287256985 hasConceptScore W4287256985C192562407 @default.
- W4287256985 hasConceptScore W4287256985C197657726 @default.
- W4287256985 hasConceptScore W4287256985C203776342 @default.
- W4287256985 hasConceptScore W4287256985C2778307483 @default.
- W4287256985 hasConceptScore W4287256985C33923547 @default.
- W4287256985 hasConceptScore W4287256985C43517604 @default.
- W4287256985 hasConceptScore W4287256985C80899671 @default.
- W4287256985 hasLocation W42872569851 @default.
- W4287256985 hasOpenAccess W4287256985 @default.
- W4287256985 hasPrimaryLocation W42872569851 @default.
- W4287256985 hasRelatedWork W1651418664 @default.
- W4287256985 hasRelatedWork W1995561296 @default.
- W4287256985 hasRelatedWork W2000733590 @default.
- W4287256985 hasRelatedWork W2058979826 @default.
- W4287256985 hasRelatedWork W2350859131 @default.
- W4287256985 hasRelatedWork W2375461657 @default.
- W4287256985 hasRelatedWork W2531852766 @default.
- W4287256985 hasRelatedWork W3009300612 @default.
- W4287256985 hasRelatedWork W3089023975 @default.
- W4287256985 hasRelatedWork W4287256985 @default.
- W4287256985 isParatext "false" @default.
- W4287256985 isRetracted "false" @default.
- W4287256985 workType "article" @default.