Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Jay Garchar"'
Publikováno v:
Algorithmica. 84:2842-2870
For a class $\mathcal{G}$ of graphs, the problem SUBGRAPH COMPLEMENT TO $\mathcal{G}$ asks whether one can find a subset $S$ of vertices of the input graph $G$ such that complementing the subgraph induced by $S$ in $G$ results in a graph in $\mathcal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bf1954febbdcbe957e1f0b67c25ecd69
https://doi.org/10.1007/s00453-022-00991-3
https://doi.org/10.1007/s00453-022-00991-3
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783030868376
WG
WG
For a class \(\mathcal {G}\) of graphs, the problem Subgraph Complement to \(\mathcal {G}\) asks whether one can find a subset S of vertices of the input graph G such that complementing the subgraph induced by S in G results in a graph in \(\mathcal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::046df5edf9853b92c347a442a9128ed4
https://doi.org/10.1007/978-3-030-86838-3_9
https://doi.org/10.1007/978-3-030-86838-3_9
