Results 21 to 30 of about 17,874 (261)
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
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
Theoretical Computer Science, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Demange, Marc, Paschos, Vangelis
openaire +2 more sources
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
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
Cubicity, boxicity, and vertex cover
Discrete Mathematics, 2009 A $k$-dimensional box is the cartesian product $R_1 \times R_2 \times ... \times R_k$ where each $R_i$ is a closed interval on the real line. The {\it boxicity} of a graph $G$, denoted as $box(G)$, is the minimum integer $k$ such that $G$ is the intersection graph of a collection of $k$-dimensional boxes.
L. Sunil Chandran +2 more
openaire +2 more sources
Squarefree Vertex Cover Algebras [PDF]
Communications in Algebra, 2013 In this paper we introduce squarefree vertex cover algebras. We study the question when these algebras coincide with the ordinary vertex cover algebras and when these algebras are standard graded. In this context we exhibit a duality theorem for squarefree vertex cover algebras.
Bayati, Shamila, Rahmati, Farhad
openaire +2 more sources
Scientific Reports, 2021 Whenever some phenomenon can be represented as a graph or a network it seems pertinent to explore how much the mathematical properties of that network impact the phenomenon. In this study we explore the same philosophy in the context of immunology.
Arindam Banerjee +2 more
doaj +1 more source
Identifying Vertex Covers in Graphs
The Electronic Journal of Combinatorics, 2012 An identifying vertex cover in a graph $G$ is a subset $T$ of vertices in $G$ that has a nonempty intersection with every edge of $G$ such that $T$ distinguishes the edges, that is, $e \cap T \ne \emptyset$ for every edge $e$ in $G$ and $e \cap T \ne f \cap T$ for every two distinct edges $e$ and $f$ in $G$.
Michael A. Henning, Anders Yeo
openaire +2 more sources
Edge Dominating Sets and Vertex Covers
Discussiones Mathematicae Graph Theory, 2013 Bipartite graphs with equal edge domination number and maximum matching cardinality are characterized. These two parameters are used to develop bounds on the vertex cover and total vertex cover numbers of graphs and a resulting chain of vertex covering ...
Dutton Ronald, Klostermeyer William F.
doaj +1 more source