Results 51 to 60 of about 2,495,395 (314)
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
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
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 +3 more sources
Homologous expression and purification of human HAX‐1 for structural studies
FEBS Open Bio, EarlyView.This research protocol provides detailed instructions for cloning, expressing, and purifying large quantities of the intrinsically disordered human HAX‐1 protein, N‐terminally fused to a cleavable superfolder GFP, from mammalian cells. HAX‐1 is predicted to undergo posttranslational modifications and to interact with membranes, various cellular ...
Mariana Grieben
wiley +1 more source
Reducing the rank of a matroid [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 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
Advanced Biology, EarlyView.The unrolling of the peltate leaves in Syngonium podophyllum is analyzed and quantified (left‐hand side to center). These measurements serve to verify a mathematical model for leaf unrolling based on the model used in Schmidt (2007). An additional formula for obtaining a layer mismatch from a prescribed radius is derived.
Michelle Modert +4 more
wiley +1 more source
Statistical Mechanics of the Hyper Vertex Cover Problem
, 2007 We introduce and study a new optimization problem called Hyper Vertex Cover. This problem is a generalization of the standard vertex cover to hypergraphs: one seeks a configuration of particles with minimal density such that every hyperedge of the ...
H. Q. Ngo +8 more
core +2 more sources
Advanced Biology, EarlyView.In this study, Seaman et al. develop a co‐culture assay to examine interactions between prostate cancer cells and mineralized osteoblasts in a microfluidic platform. The authors collect conditioned media from static or flow‐stimulated osteocytes and demonstrate that mechanical loading of osteocytes regulates the growth of prostate cancer cells and ...
Kimberly Seaman +5 more
wiley +1 more source
Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints
AlgorithmsIn 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
Parameterized complexity of fair deletion problems
, 2017 Deletion problems are those where given a graph $G$ and a graph property $\pi$, the goal is to find a subset of edges such that after its removal the graph $G$ will satisfy the property $\pi$. Typically, we want to minimize the number of elements removed.
Masařík, Tomáš, Toufar, Tomáš
core +1 more source