Results 61 to 70 of about 1,660,013 (253)
The Curse of Connectivity: t-Total Vertex (Edge) Cover
We investigate the effect of certain natural connectivity constraints on the parameterized complexity of two fundamental graph covering problems, namely k-Vertex Cover and k-Edge Cover.
Fomin, Fedor V. +3 more
core +3 more sources
Reducing the rank of a matroid [PDF]
We consider the rank reduction problem for matroids: Given a matroid $M$ and an integer $k$, find a minimum size subset of elements of $M$ whose removal reduces the rank of $M$ by at least $k$. When $M$ is a graphical matroid this problem is the minimum $
Gwenaël Joret, Adrian Vetta
doaj +1 more source
Computing L(p,1)-Labeling with Combined Parameters
Given a graph, an $L(p,1)$-labeling of the graph is an assignment $f$ from the vertex set to the set of nonnegative integers such that for any pair of vertices $u$ and $v$, $|f (u) - f (v)| \ge p$ if $u$ and $v$ are adjacent, and $f(u) \neq f(v)$ if $u ...
Tesshu Hanaka +2 more
doaj +1 more source
Message passing for vertex covers [PDF]
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
Martin Weigt, Haijun Zhou
openaire +3 more sources
Description: Indium metal serves as a reversible calcium‐alloying negative electrode. By transitioning from planar electrodes to powders and (sub‐)micron indium particles, the specific surface area is increased, improving the areal capacity density and cycling stability for calcium‐based batteries.
Wouter Monnens +10 more
wiley +1 more source
Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints
In this paper, we consider the minimal vertex cover and minimal dominating sets with capacity and/or connectivity constraint enumeration problems. We develop polynomial-delay enumeration algorithms for these problems on bounded-degree graphs.
Yasuaki Kobayashi +4 more
doaj +1 more source
An Exact Algorithm for Minimum Vertex Cover Problem
In this paper, we propose a branch-and-bound algorithm to solve exactly the minimum vertex cover (MVC) problem. Since a tight lower bound for MVC has a significant influence on the efficiency of a branch-and-bound algorithm, we define two novel lower ...
Luzhi Wang +3 more
doaj +1 more source
Solution‐based ligand‐assisted epitaxial growth (LAEG) yields high‐quality CsPbBr3 microcrystals on different substrates with superior morphology, passivated surfaces, and high photoluminescence quantum yield. These robust micro‐resonators achieve record‐low room‐temperature lasing thresholds of 7.2 kW·cm−2 and maintain operational stability up to 90 ...
Shuyu Zhou +19 more
wiley +1 more source
Properties of vertex cover obstructions
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael J. Dinneen, Rongwei Lai
openaire +3 more sources
The Effect of Hydrophilic Headgroup Chemistry on Peptoid‐Directed Mineralization of CaCO3
Amphiphilic peptoids alter the pathway and outcome of calcium carbonate crystallization, which progresses through amorphous calcium carbonate (ACC) to vaterite to calcite rhombs in the absence of peptoids. In contrast, amine‐terminated peptoids produce vaterite disks and carboxyl‐terminated peptoids produce calcite mesocrystals.
Biao Jin +5 more
wiley +1 more source

