Results 21 to 30 of about 1,660,013 (253)
Parameterized streaming : maximal matching and vertex cover [PDF]
As graphs continue to grow in size, we seek ways to effectively process such data at scale. The model of streaming graph processing, in which a compact summary is maintained as each edge insertion/deletion is observed, is an attractive one.
Chitnis, Rajesh; id_orcid +11 more
core +1 more source
An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth [PDF]
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
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Demange, Marc, Paschos, Vangelis
openaire +2 more sources
Minimum 2SAT-DELETION: inapproximability results and relations to Minimum Vertex Cover [PDF]
The MINIMUM 2SAT-DELETION problem is to delete the minimum number of clauses in a 2SAT instance to make it satisfiable. It is one of the prototypes in the approximability hierarchy of minimization problems Khanna et al.
Chlebikova, Janka +3 more
core +1 more source
Dimension Incremental Feature Selection Approach for Vertex Cover of Hypergraph Using Rough Sets
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
Verified Approximation Algorithms [PDF]
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
Truly non-trivial graphoidal graphs
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
Crown reductions for the Minimum Weighted Vertex Cover problem [PDF]
The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown rules: some new directions in FPT, in: Proceedings of the 29th International ...
Chlebikova, Janka +5 more
core +1 more source
Domination in graphoidally covered graphs: Least-kernel graphoidal graphs-II
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
Covering all edges of a graph by a small number of vertices, this is the NP-hard Vertex Cover problem, is among the most fundamental algorithmic tasks. Following a recent trend in studying dynamic and temporal graphs, we initiate the study of Multistage ...
Fluschnik, Till +3 more
core +1 more source

