Results 41 to 50 of about 166,020 (278)
Distributed Vertex Cover Reconfiguration
CoRR, 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.
Keren Censor-Hillel +3 more
openaire +4 more sources
The Connected Vertex Cover in Graphs
Theory and Applications of GraphsThis paper presents tight bounds and characterizations for the vertex cover number and the connected vertex cover number of graphs. In particular, we identify all graphs for which βc(G) = |V (G)| − 1, proving that these are exactly the cycles and ...
Kamran Mirasheh +2 more
doaj +1 more source
Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers [PDF]
, 2013 In this paper, we study a class of set cover problems that satisfy a special property which we call the {\em small neighborhood cover} property. This class encompasses several well-studied problems including vertex cover, interval cover, bag interval ...
Agarwal, Archita +4 more
core +2 more sources
TREEWIDTH and PATHWIDTH parameterized by vertex cover
, 2013 After the number of vertices, Vertex Cover is the largest of the classical graph parameters and has more and more frequently been used as a separate parameter in parameterized problems, including problems that are not directly related to the Vertex Cover.
Chapelle, Mathieu +3 more
core +4 more sources
Vertex covering with capacitated trees
Networks, 2022 AbstractThe covering of a graph with (possibly disjoint) connected subgraphs is a fundamental problem in graph theory. In this paper, we study a version to cover a graph's vertices by connected subgraphs subject to lower and upper weight bounds, and propose a column generation approach to dynamically generate feasible and promising subgraphs. Our focus
Ralf Borndörfer +2 more
openaire +2 more sources
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
Wasit Journal for Pure Sciences, 2023 In this paper, we presented a new properties of a weakly completely prime graph, where we added the algebraic properties in this graph and extracted from them some important theories and results, with the study of homomorphism in this graph when ...
ameer al-swidi, Ahmed A.Omran
doaj +1 more source
An Optimized Topology Discovery Mechanism in Software Defined Networks
Journal of Harbin University of Science and Technology, 2022 Aiming at the problems of excessive resource consumption and low operating efficiency in the topology discovery mechanism in Software Defined Networks (SDN), a stronger topology discovery mechanism (S-OFDP) is proposed.
LI Lan-ying, WANG Min, ZHU Su-xia
doaj +1 more source
Some Graph Polynomials of the Power Graph and its Supergraphs [PDF]
Mathematics Interdisciplinary Research, 2020 In this paper, exact formulas for the dependence, independence, vertex cover and clique polynomials of the power graph and its supergraphs for certain finite groups are presented.
Asma Hamzeh
doaj +1 more source
Vertex cover problem studied by cavity method: Analytics and population dynamics
, 2003 We study the vertex cover problem on finite connectivity random graphs by zero-temperature cavity method. The minimum vertex cover corresponds to the ground state(s) of a proposed Ising spin model.
Zhou, Haijun
core +2 more sources