Matches in SemOpenAlex for { <https://semopenalex.org/work/W4380876871> ?p ?o ?g. }
Showing items 1 to 57 of
57
with 100 items per page.
- W4380876871 abstract "For a class $mathcal{G}$ of graphs, the objective of textsc{Subgraph Complementation to} $mathcal{G}$ is to find whether there exists a subset $S$ of vertices of the input graph $G$ such that modifying $G$ by complementing the subgraph induced by $S$ results in a graph in $mathcal{G}$. We obtain a polynomial-time algorithm for the problem when $mathcal{G}$ is the class of graphs with minimum degree at least $k$, for a constant $k$, answering an open problem by Fomin et al. (Algorithmica, 2020). When $mathcal{G}$ is the class of graphs without any induced copies of the star graph on $t+1$ vertices (for any constant $tgeq 3$) and diamond, we obtain a polynomial-time algorithm for the problem. This is in contrast with a result by Antony et al. (Algorithmica, 2022) that the problem is NP-complete and cannot be solved in subexponential-time (assuming the Exponential Time Hypothesis) when $mathcal{G}$ is the class of graphs without any induced copies of the star graph on $t+1$ vertices, for every constant $tgeq 5$." @default.
- W4380876871 created "2023-06-17" @default.
- W4380876871 creator A5021912465 @default.
- W4380876871 creator A5024184134 @default.
- W4380876871 creator A5060047035 @default.
- W4380876871 date "2023-01-01" @default.
- W4380876871 modified "2023-10-14" @default.
- W4380876871 title "Algorithms for subgraph complementation to some classes of graphs" @default.
- W4380876871 cites W2060765296 @default.
- W4380876871 cites W2097725094 @default.
- W4380876871 cites W2115674935 @default.
- W4380876871 cites W2798301280 @default.
- W4380876871 cites W2914414140 @default.
- W4380876871 cites W3135535217 @default.
- W4380876871 cites W4312273856 @default.
- W4380876871 doi "https://doi.org/10.5817/cz.muni.eurocomb23-006" @default.
- W4380876871 hasPublicationYear "2023" @default.
- W4380876871 type Work @default.
- W4380876871 citedByCount "0" @default.
- W4380876871 crossrefType "proceedings-article" @default.
- W4380876871 hasAuthorship W4380876871A5021912465 @default.
- W4380876871 hasAuthorship W4380876871A5024184134 @default.
- W4380876871 hasAuthorship W4380876871A5060047035 @default.
- W4380876871 hasBestOaLocation W43808768711 @default.
- W4380876871 hasConcept C114614502 @default.
- W4380876871 hasConcept C118615104 @default.
- W4380876871 hasConcept C132525143 @default.
- W4380876871 hasConcept C2778012994 @default.
- W4380876871 hasConcept C311688 @default.
- W4380876871 hasConcept C33923547 @default.
- W4380876871 hasConcept C71017364 @default.
- W4380876871 hasConcept C80899671 @default.
- W4380876871 hasConceptScore W4380876871C114614502 @default.
- W4380876871 hasConceptScore W4380876871C118615104 @default.
- W4380876871 hasConceptScore W4380876871C132525143 @default.
- W4380876871 hasConceptScore W4380876871C2778012994 @default.
- W4380876871 hasConceptScore W4380876871C311688 @default.
- W4380876871 hasConceptScore W4380876871C33923547 @default.
- W4380876871 hasConceptScore W4380876871C71017364 @default.
- W4380876871 hasConceptScore W4380876871C80899671 @default.
- W4380876871 hasLocation W43808768711 @default.
- W4380876871 hasLocation W43808768712 @default.
- W4380876871 hasOpenAccess W4380876871 @default.
- W4380876871 hasPrimaryLocation W43808768711 @default.
- W4380876871 hasRelatedWork W1480076195 @default.
- W4380876871 hasRelatedWork W2164428079 @default.
- W4380876871 hasRelatedWork W2173621488 @default.
- W4380876871 hasRelatedWork W2256089709 @default.
- W4380876871 hasRelatedWork W3082759585 @default.
- W4380876871 hasRelatedWork W3175594029 @default.
- W4380876871 hasRelatedWork W3196775331 @default.
- W4380876871 hasRelatedWork W4214914101 @default.
- W4380876871 hasRelatedWork W4286911546 @default.
- W4380876871 hasRelatedWork W4287689012 @default.
- W4380876871 isParatext "false" @default.
- W4380876871 isRetracted "false" @default.
- W4380876871 workType "article" @default.