Results 21 to 30 of about 17,195 (263)
The Price of Connectivity for Vertex Cover [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Eglantine Camby +3 more
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
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
Message passing for vertex covers [PDF]
Physical Review E, 2006 Constructing a minimal vertex cover of a graph can be seen as a prototype for a combinatorial optimization problem under hard constraints. In this paper, we develop and analyze message passing techniques, namely warning and survey propagation, which serve as efficient heuristic algorithms for solving these computational hard problems. We show also, how
Weigt, Martin, Zhou, Haijun
openaire +3 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
Vertex Cover Reconfiguration and Beyond
Algorithms, 2018 In the Vertex Cover Reconfiguration (VCR) problem, given a graph G, positive integers k and ℓ and two vertex covers S and T of G of size at most k, we determine whether S can be transformed into T by a sequence of at most ℓ vertex additions or removals ...
Amer E. Mouawad +3 more
doaj +1 more source
Generalization of the Cover Pebbling Number for Networks
Frontiers in Physics, 2020 Pebbling can be viewed as a model of resource transportation for networks. We use a graph to denote the network. A pebbling move on a graph consists of the removal of two pebbles from a vertex and the placement of one pebble on an adjacent vertex.
Zheng-Jiang Xia, Zhen-Mu Hong
doaj +1 more source
Reconfiguring k-path Vertex Covers [PDF]
, 2020 29 pages, 4 figures, to appear in WALCOM ...
Duc A. Hoang +2 more
openaire +2 more sources
Dynamic monopolies in simple graphs [PDF]
AUT Journal of Mathematics and ComputingThis paper studies a repetitive polling game played on an $n$-vertex graph $G$. At first, each vertex is colored, Black or White. At each round, each vertex (simultaneously) recolors itself by the color of the majority of its closed neighborhood.
Leila Musavizadeh Jazaeri +1 more
doaj +1 more source