Filters
A Parameterized Complexity View on Collapsing k-Cores
. Collapsed k-Core is a generalization of r-Degenerate Vertex Deletion (which is known to be NP-hard for all r >= 0) where, given an undirected graph G and integers b and r, we are asked to remove...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2021 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
A Parameterized Complexity View on Collapsing k-Cores
drop outs. Collapsed k-Core is a generalization of r-Degenerate Vertex Deletion (which is known to be NP-hard for all r >=0) where, given an undirected graph G and integers b and r, we are asked ...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2019 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion
Vertex deletion problems ask whether it is possible to delete at most k. Over the past years, the parameterized complexity of vertex deletion to a plethora-exponential fixed-parameter algorithm for ver...
IN - Informatika
- 2016 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Parameterized complexity of fair deletion problems
is changed, so the maximum number of deletions in a neighborhood of a single vertex vertex cover of graph G. We prove the W[1]-hardness of the fair FO vertex-deletion-deletion problem parameteriz...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2020 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
Vertex deletion problems ask whether it is possible to delete at most k. Over the past years, the parameterized complexity of vertex deletion to a plethora-exponential fixed-parameter tractable algorithm f...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2018 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Parameterized Complexity of Fair Deletion Problems
of deletions in a neighborhood of a single vertex. We study the parameterized complexity vertex-deletion problem with respect to the first three parameters combined. Moreover, we show that there is no algorithm fo...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2017 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Factorizations of complete graphs into [n,r,s,2]-caterpillars with maximum center
A tree $R$ such that after deleting all leaves we obtain a path $P$ is called a {it caterpillar}. The path $P$ is called the {it spine} of the caterpillar $R$. If the spine has length 3 and $R$ on $2n$ vertices con...
BA - Obecná matematika
- 2004 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width
The cluster vertex deletion number of a graph is the minimum number of its vertices whose deletion results in a disjoint union of complete graphs. This generalizes the vertex cover number, provides an upper bound t...
IN - Informatika
- 2012 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
We study the parameterized complexity of the Bounded-Degree Vertex Deletion such as the feedback vertex set number, pathwidth, treedepth, and even the size of a minimum vertex deletion set into graphs of p...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2018 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
An FPT algorithm for Tree Deletion Set
deletion results in a tree. Such a subset is a restricted form of a feedback vertex set. Whileparameterized complexity of feedback vertex set problem and several of its variations have algorithm for this version of feedbac...
IN - Informatika
- 2013 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
- 1 - 10 out of 23 581