Results 31 to 40 of about 142,209 (249)
On Cutwidth Parameterized by Vertex Cover [PDF]
Algorithmica, 2012 We study the Cutwidth problem, where the input is a graph G, and the objective is find a linear layout of the vertices that minimizes the maximum number of edges intersected by any vertical line inserted between two consecutive vertices. We give an algorithm for Cutwidth with running time O(2 k n O(1)).
Cygan, Marek +4 more
openaire +7 more sources
TS-Reconfiguration of $k$-Path Vertex Covers in Caterpillars for $k \geq 4$
Theory and Applications of Graphs, 2023 A k-path vertex cover (k-PVC) of a graph G is a vertex subset I such that each path on k vertices in G contains at least one member of I. Imagine that a token is placed on each vertex of a k-PVC.
Duc A. Hoang
doaj +1 more source
ALGORITMO DE COBERTURA DE VÉRTICES
Revista Ingeniería, Matemáticas y Ciencias de la Información, 2023 Problem to solve P=NP, using the coverage problem of a graph that is NP and convert it to P. In the mathematicaldiscipline of graph theory, a vertex cover, simply a graph cover, is a set of vertices such that each edge of the graph isincident to at least
Javier López Wong
doaj +1 more source
Verified Approximation Algorithms [PDF]
Logical Methods in Computer Science, 2022 We present the first formal verification of approximation algorithms for NP-complete optimization problems: vertex cover, independent set, set cover, center selection, load balancing, and bin packing.
Robin Eßmann +3 more
doaj +1 more source
Matroid-constrained vertex cover
Theoretical Computer Science, 2023 In this paper, we introduce the problem of Matroid-Constrained Vertex Cover: given a graph with weights on the edges and a matroid imposed on the vertices, our problem is to choose a subset of vertices that is independent in the matroid, with the objective of maximizing the total weight of covered edges.
Chien-Chung Huang, François Sellier
openaire +2 more sources
An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Given a graph $G=(V,E)$ and a positive integer $t\geq2$, the task in the vertex cover $P_t$ ($VCP_t$) problem is to find a minimum subset of vertices $F\subseteq V$ such that every path of order $t$ in $G$ contains at least one vertex from $F$.
Zongwen Bai, Jianhua Tu, Yongtang Shi
doaj +1 more source
Truly non-trivial graphoidal graphs
AKCE International Journal of Graphs and Combinatorics, 2022 A graphoidal cover of a graph G is a collection [Formula: see text] of non-trivial paths in G, which are not necessarily open, such that every vertex of G is an internal vertex of at most one path in [Formula: see text] and every edge of G is in exactly ...
Rajesh Singh, Purnima Gupta, S. Arumugam
doaj +1 more source
Theoretical Computer Science, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Demange, Marc, Paschos, Vangelis
openaire +3 more sources
Dimension Incremental Feature Selection Approach for Vertex Cover of Hypergraph Using Rough Sets
IEEE Access, 2018 The minimum vertex cover problem is a well-known optimization problem; it has been used in a wide variety of applications. This paper focuses on rough set-based approach for the minimum vertex cover problem of the dynamic and static hypergraphs.
Qian Zhou, Xiaolin Qin, Xiaojun Xie
doaj +1 more source
Domination in graphoidally covered graphs: Least-kernel graphoidal graphs-II
AKCE International Journal of Graphs and Combinatorics, 2018 Given a graph , not necessarily finite, a graphoidal cover of means a collection of non-trivial paths in called -edges, which are not necessarily open (not necessarily finite), such that every vertex of is an internal vertex of at most one path in and ...
Purnima Gupta, Rajesh Singh
doaj +2 more sources