scientific article; zbMATH DE number 7083450

Publication date: 19 July 2019

Full work available at URL: http://mathnet.ru/eng/timb269

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
The $(1, 2)$-step competition graph of a pure local tournament that is not round decomposable
In-place permuting and perfect shuffling using involutions
On the weighted $k$-path vertex cover problem
A fixed-parameter algorithm for the vertex cover $P_3$ problem
PTAS for minimum $k$-path vertex cover in ball graph
A PTAS for minimum weighted connected vertex cover $P_3$ problem in 3-dimensional wireless sensor networks
On computing the minimum 3-path vertex cover and dissociation number of graphs
A primal-dual approximation algorithm for the vertex cover $P^3$ problem
Some variations of perfect graphs
An optimal parallel solution for the path cover problem on $P_{4}$-sparse graphs
A faster FPT algorithm for 3-path vertex cover
Some results on graphs without long induced paths
The node-deletion problem for hereditary properties is NP-complete
A unified approximation algorithm for node-deletion problems
Fixed-parameter algorithms for Vertex Cover $P_3$
On the $k$-path vertex cover of some graph products
Exact combinatorial algorithms and experiments for finding maximum $k$-plexes
A factor $2$ approximation algorithm for the vertex cover $P_3$ problem
On a relation between $k$-path partition and $k$-path vertex cover
Minimum $k$-path vertex cover
The complexity of dissociation set problems in graphs
The $k$-path vertex cover of rooted product graphs
PTAS for the minimum $k$-path connected vertex cover problem in unit disk graphs
On the vertex cover $P_3$ problem parameterized by treewidth
On the vertex $k$-path cover
Approximation algorithm for the minimum weight connected $k$-subgraph cover problem
NP-hard graph problems and boundary classes of graphs
A PTAS for the minimum weight connected vertex cover $P_3$ problem on unit disk graphs
Independent packings in structured graphs
A 2-approximation algorithm for the vertex coverP₄problem in cubic graphs
Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion
Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs
On F-independence in graphs
Node-Deletion NP-Complete Problems
Node-Deletion Problems on Bipartite Graphs
The Recognition of Series Parallel Digraphs
An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth
The k-Observer Problem on d-regular Graphs