Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Prafullkumar Tale"'
Publikováno v:
Theoretical Computer Science. 860:98-116
We know that Tree Contraction does not admit a polynomial kernel unless NP ⊆ coNP/poly , while Path Contraction admits a kernel with O ( k ) vertices. The starting point of this article is the following natural questions: What is the structure of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ffa0d9df3183bac8b91557294a0d9781
https://doi.org/10.1016/j.tcs.2021.01.033
https://doi.org/10.1016/j.tcs.2021.01.033
Publikováno v:
Theoretical Computer Science. 954:113803
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc21389e44dc13020d130a1fb02ea6ef
https://doi.org/10.1016/j.tcs.2023.113803
https://doi.org/10.1016/j.tcs.2023.113803
Publikováno v:
Discret. Appl. Math.
A class domination coloring (also called cd-Coloring or dominated coloring) of a graph is a proper coloring in which every color class is contained in the neighbourhood of some vertex. The minimum number of colors required for any cd-coloring of $G$,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b01fd4ce0545ec0bf619b4d5d1d541e
Autor:
Prafullkumar Tale
Publikováno v:
Theor. Comput. Sci.
For $\alpha \ge 1$, $\beta \ge 0$, and a graph $G$, a spanning subgraph $H$ of $G$ is said to be an $(\alpha, \beta)$-spanner if $\dist(u, v, H) \le \alpha \cdot \dist(u, v, G) + \beta$ holds for any pair of vertices $u$ and $v$. These type of spanne
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c8a7f75096d129971b0ad7df30dc8559
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4578599ce1aea51a40bc33bfb11313e9
https://doi.org/10.2139/ssrn.4236299
https://doi.org/10.2139/ssrn.4236299
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783031159138
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bfe5497413a221059d5e240f717d69b0
https://doi.org/10.1007/978-3-031-15914-5_19
https://doi.org/10.1007/978-3-031-15914-5_19
Publikováno v:
Theoretical Computer Science. 772:132-142
A harmonious coloring of a graph is a partitioning of its vertex set into parts such that, there are no edges inside each part, and there is at most one edge between any pair of parts. It is known that finding a minimum harmonious coloring number is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7c2b59946a4b3d3e6385f9d152686ba8
https://doi.org/10.1016/j.tcs.2018.12.011
https://doi.org/10.1016/j.tcs.2018.12.011
A graph $H$ is {\em $p$-edge colorable} if there is a coloring $\psi: E(H) \rightarrow \{1,2,\dots,p\}$, such that for distinct $uv, vw \in E(H)$, we have $\psi(uv) \neq \psi(vw)$. The {\sc Maximum Edge-Colorable Subgraph} problem takes as input a gr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ab912cc79d552f1d3f28d1fee1b39b70
http://arxiv.org/abs/2008.07953
http://arxiv.org/abs/2008.07953
Publikováno v:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Leibniz International Proceedings in Informatics
Leibniz International Proceedings in Informatics
A graph operation that contracts edges is one of the fundamental operations in the theory of graph minors. Parameterized Complexity of editing to a family of graphs by contracting k edges has recently gained substantial scientific attention, and seve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6ae75472ad5d5bd658f996752567fad
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030581497
COCOON
COCOON
A graph H is p-edge colorable if there is a coloring \(\psi : E(H) \rightarrow \{1,2,\dots ,p\}\), such that for distinct \(uv, vw \in E(H)\), we have \(\psi (uv) \ne \psi (vw)\). The Maximum Edge-Colorable Subgraph problem takes as input a graph G a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80c7065806a8a7a076992b508e121174
https://doi.org/10.1007/978-3-030-58150-3_50
https://doi.org/10.1007/978-3-030-58150-3_50