Results 101 to 110 of about 1,660,013 (253)
The standard graded property for vertex cover algebras of quasi-trees
In [5] the authors characterize the vertex cover algebras which are tandard graded. In this paper we give a simple combinatorial criterion for the standard graded property of vertex cover algebras in the case of quasi-trees.
Alexandru Costantinescu, Le Dinh Nam
doaj
Remote catalytic dehydrogenation enables the direct growth of monolayer amorphous carbon on a 2‐inch sapphire wafer by thermal CVD. Spatial separation of the catalyst from the growth substrate eliminates metallic residue and post‐growth processing, yielding a wafer‐scale uniform film with a random polygonal sp2‐hybridized carbon network that exhibits ...
Muhammad Sabbtain Abbas +8 more
wiley +1 more source
Kernelization of Vertex Cover by Structural Parameters [PDF]
In the NP-complete problem Vertex Cover, one is given a graph G and an integer k and are asked whether there exists a vertex set S ⊆ V (G) with size at most k such that every edge of the graph is incident to a vertex in S.
Strømme, Torstein Jarl Fagerbakke
core
Rank vertex cover as a natural problem for algebraic compression [PDF]
The question of the existence of a polynomial kernelization of the Vertex Cover Above LP problem was a long-standing, notorious open problem in parameterized complexity.
Meesum, Syed Mohammad +4 more
core +1 more source
Synthesis and screening of a polymer library produced a versatile and inhalable mRNA vehicle for the lungs (P81). Compared to a published LNP, P81 provides increased delivery efficacy, achieving widespread expression in broad cell types, with no toxicity.
Pramodkumar EK +36 more
wiley +1 more source
Properties of Vertex Cover Obstructions
We study properties of O(k–Vertex Cover) which denotes all forbidden graphs (as minors) to the family of graphs with vertex cover at most k, k ≥ 0. Our main result is to give a tight vertex bound of O(k–Vertex Cover), and then confirm a conjecture made ...
Michael J. Dinneen, Rongwei Lai
core
Efficient Algorithms for the max k -vertex cover Problem
International audienceWe first devise moderately exponential exact algorithms for max k -vertex cover, with time-complexity exponential in n but with polynomial space-complexity by developing a branch and reduce method based upon the measure-and-conquer ...
Vangelis Th. Paschos +8 more
core +1 more source
Eternal Vertex Cover on Bipartite Graphs
The Eternal Vertex Cover problem is a dynamic variant of the vertex cover problem. We have a two player game in which guards are placed on some vertices of a graph. In every move, one player (the attacker) attacks an edge.
Nanoti, Saraswati Girish +2 more
core +1 more source
Application of an Extremal Result of Erdős and Gallai to the (n,k,t) Problem
An extremal result about vertex covers, attributed by Hajnal to Erdős and Gallai, is applied to prove the following: If n, k, and t are integers satisfying n ≥ k ≥ t ≥ 3 and k ≤ 2t - 2, and G is a graph with the minimum number of edges among graphs on n ...
Matt Noble +3 more
doaj +1 more source
Life‐Like Ferrous Oxide Microspheres from Kombucha
Kombucha bacterial cellulose, sodium alginate, and ferrous nitrate self‐assemble into membrane‐enclosed iron oxide microspheres. These microspheres bud daughter vesicles, sustain 24‐h electrochemical oscillations, and filter theta‐band signals.
Panagiotis Mougkogiannis +2 more
wiley +1 more source

