Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Komal Muluk"'
Publikováno v:
CSR
Given a graph \(G=(V,E)\), a subset \(S\subseteq V(G)\) is said to be a feedback vertex set of G if \(G-S\) is a forest. In the Feedback Vertex Set (FVS) problem, we are given an undirected graph G, and a positive integer k, the question is whether t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::483b6649a1ef8694a3ef921dd4cfc5d3
https://doi.org/10.1016/j.tcs.2021.03.008
https://doi.org/10.1016/j.tcs.2021.03.008
Autor:
Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh
Publikováno v:
Combinatorial Algorithms
A digraph D is singly connected if for all ordered pairs of vertices \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5f2a5caf2831b32bac641adf19f3a9c9
http://europepmc.org/articles/PMC7254902
http://europepmc.org/articles/PMC7254902
Publikováno v:
4OR 20(4), 713-718 (2021). doi:10.1007/s10288-021-00499-6
4OR (2021). doi:10.1007/s10288-021-00499-6
Published by Springer, Berlin ; Heidelberg
Published by Springer, Berlin ; Heidelberg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d311d8eeef3ac32c1bacbf9e5b486125
https://publications.rwth-aachen.de/record/838285
https://publications.rwth-aachen.de/record/838285
Publikováno v:
Computer Science – Theory and Applications ISBN: 9783030500252
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d2fdb8c418df78eed580130b9784b774
https://doi.org/10.1007/978-3-030-50026-9_18
https://doi.org/10.1007/978-3-030-50026-9_18
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030489656
IWOCA
IWOCA
A digraph D is singly connected if for all ordered pairs of vertices \(u,v\in V(D)\), there is at most one path in D from u to v. In this paper, we study the Singly Connected Vertex Deletion (SCVD) problem: Given an n-vertex digraph D and a positive
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3dd8fc4d67b96db584932151355faea2
https://doi.org/10.1007/978-3-030-48966-3_18
https://doi.org/10.1007/978-3-030-48966-3_18
Publikováno v:
4OR; Dec2022, Vol. 20 Issue 4, p713-718, 6p
This book constitutes the refereed proceedings of the 34th International Workshop on Combinatorial Algorithms, IWOCA 2023, held in Tainan, Taiwan, during June 7–10, 2023. The 33 full papers included in this book were carefully reviewed and select
This book constitutes the proceedings of the 47th International Workshop on Graph-Theoretic Concepts in Computer Science which was held during June 23–25, 2021. The conference was planned to take place in Warsaw, Poland, but changed to an online
Autor:
Henning Fernau
This book constitutes the proceedings of the 15th International Computer Science Symposium in Russia, CSR 2020, held in Yekaterinburg, Russia, in June 2020. The 25 full papers and 6 invited papers were carefully reviewed and selected from 49 submissi
This book constitutes the proceedings of the 31st International Workshop on Combinatorial Algorithms which was planned to take place in Bordeaux, France, during June 8–10, 2020. Due to the COVID-19 pandemic the conference changed to a virtual for