Results 41 to 50 of about 2,495,395 (314)

A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover [PDF]

, 2002
Given a $k$-uniform hyper-graph, the E$k$-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyper-edge. We present a new multilayered PCP construction that extends the Raz verifier.
Dinur, Irit, Guruswami, Venkatesan, Khot, Subhash, Regev, Oded   +3 more
core   +4 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, Steven S. Skiena, Yochai Twitto   +2 more
doaj   +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

A Travelling Wave-Based Fault Location Strategy Using the Concepts of Metric Dimension and Vertex Covers in a Graph

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, Jacques M. Maritz, Moslem Salehi   +2 more
doaj   +1 more source

Kernelization and Parameterized Algorithms for 3-Path Vertex Cover

, 2016
A 3-path vertex cover in a graph is a vertex subset $C$ such that every path of three vertices contains at least one vertex from $C$. The parameterized 3-path vertex cover problem asks whether a graph has a 3-path vertex cover of size at most $k$.
B Brešar, B Brešar, BY Wu, CH Papadimitriou, E Prieto, F Göring, F Kardoš, FV Fomin, H Fermau, J Chen, J Katrenič, J Tu, J Wang, K Asdre, K Cameron, M Xiao, M Xiao, M Xiao, M Yannakakis, MR Fellows, R Boliac, R-W Hung, VE Alekseev, VV Lozin, Y Orlovich   +24 more
core   +1 more source

Vertex Cover Hop Dominating Sets in Graphs

European Journal of Pure and Applied Mathematics
Let $G$ be a graph. Then a subset $C$ of vertices of $G$ is called a vertex cover hop dominating if $C$ is both a vertex cover and a hop dominating of $G$.
Vergel T. Bilar, Maria Andrea O. Bonsocan, Javier A. Hassan, Susan C. Dagondon   +3 more
semanticscholar   +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

Temporal Vertex Cover with a Sliding Time Window [PDF]

International Colloquium on Automata, Languages and Programming, 2018
Modern, inherently dynamic systems are usually characterized by a network structure, i.e. an underlying graph topology, which is subject to discrete changes over time.
Eleni C. Akrida, G. B. Mertzios, P. Spirakis, V. Zamaraev   +3 more
semanticscholar   +1 more source

Weakly Completely Prime Graph

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

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