Results 41 to 50 of about 142,209 (249)
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 Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter [PDF]
, 2012 An important result in the study of polynomial-time preprocessing shows that there is an algorithm which given an instance (G,k) of Vertex Cover outputs an equivalent instance (G',k') in polynomial time with the guarantee that G' has at most 2k' vertices
A. Schrijver +43 more
core +2 more sources
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
Cubicity, boxicity, and vertex cover
Discrete Mathematics, 2009 12 ...
Chandran, LS, Das, Anita, Shah, CD
openaire +3 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
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
Combinatorial Dominance Guarantees for Heuristic Algorithms [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 An $f(n)$ $\textit{dominance bound}$ on a heuristic for some problem is a guarantee that the heuristic always returns a solution not worse than at least $f(n)$ solutions.
Daniel Berend +2 more
doaj +1 more source
IEEE Access, 2021 This paper presents a novel travelling wave-based placement strategy and fault detection scheme to locate faults on complex power grids. A fault occurring on a power grid results in travelling waves propagating from the fault location towards detectors ...
Elizabeth C. M. Maritz +2 more
doaj +1 more source
Distributed Vertex Cover Reconfiguration
, 2021 Reconfiguration schedules, i.e., sequences that gradually transform one solution of a problem to another while always maintaining feasibility, have been extensively studied. Most research has dealt with the decision problem of whether a reconfiguration schedule exists, and the complexity of finding one.
Censor-Hillel, Keren +3 more
openaire +4 more sources
Vertex cover and Edge vertex domination in trees
Proyecciones (Antofagasta), 2021 Let G = (V,E) be a simple graph. An edge e ∈ E(G) edge-vertex dominates a vertex v ∈ V (G) if e is incident with v or e is incident with a vertex adjacent to v. A subset D ⊆ E(G) is an edge-vertex dominating set of a graph G if every vertex of G is edge-vertex dominated by an edge of D.
Y. B. Venkatakrishnan +2 more
openaire +3 more sources