Results 31 to 40 of about 2,372,931 (298)
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
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
Dominating Vertex Covers: The Vertex-Edge Domination Problem
Discussiones Mathematicae Graph Theory, 2021 The vertex-edge domination number of a graph, γve(G), is defined to be the cardinality of a smallest set D such that there exists a vertex cover C of G such that each vertex in C is dominated by a vertex in D.
Klostermeyer William F. +2 more
doaj +1 more source
Theory of Computing Systems, 2019 The NP-complete Vertex Cover problem asks to cover all edges of a graph by a small (given) number of vertices. It is among the most prominent graph-algorithmic problems.
T. Fluschnik +3 more
semanticscholar +1 more source
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2017 Randomized composable coresets were introduced recently as an effective technique for solving matching and vertex cover problems in various models of computation. In this technique, one partitions the edges of an input graph randomly into multiple pieces,
Sepehr Assadi +4 more
semanticscholar +1 more source
The distinguishing number and the distinguishing index of line and graphoidal graph(s)
AKCE International Journal of Graphs and Combinatorics, 2020 The distinguishing number (index) () of a graph is the least integer such that has a vertex labeling (edge labeling) with labels that is preserved only by a trivial automorphism.
Saeid Alikhani, Samaneh Soltani
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