Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Neogi, Rian"'
A graph is $k$-clique-extendible if there is an ordering of the vertices such that whenever two $k$-sized overlapping cliques $A$ and $B$ have $k-1$ common vertices, and these common vertices appear between the two vertices $a,b\in (A\setminus B)\cup
Externí odkaz:
http://arxiv.org/abs/2007.06060
{\sc Directed Feedback Vertex Set (DFVS)} is a fundamental computational problem that has received extensive attention in parameterized complexity. In this paper, we initiate the study of a wide generalization, the {\sc ${\cal H}$-free SCC Deletion}
Externí odkaz:
http://arxiv.org/abs/2005.01359
A graph is said to be a Konig graph if the size of its maximum matching is equal to the size of its minimum vertex cover. The Konig Edge Deletion problem asks if in a given graph there exists a set of at most k edges whose deletion results in a Konig
Externí odkaz:
http://arxiv.org/abs/1811.04560
Publikováno v:
In Theoretical Computer Science 3 December 2019 796:207-215
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.