Results 41 to 50 of about 310,757 (283)
Dynamics of heuristic optimization algorithms on random graphs
, 2002 In this paper, the dynamics of heuristic algorithms for constructing small vertex covers (or independent sets) of finite-connectivity random graphs is analysed. In every algorithmic step, a vertex is chosen with respect to its vertex degree. This vertex,
Weigt, Martin
core +1 more source
Estimation of vertex degrees in a sampled network [PDF]
2017 51st Asilomar Conference on Signals, Systems, and Computers, 2017 The need to produce accurate estimates of vertex degree in a large network, based on observation of a subnetwork, arises in a number of practical settings. We study a formalized version of this problem, wherein the goal is, given a randomly sampled subnetwork from a large parent network, to estimate the actual degree of the sampled nodes.
Ganguly, Apratim, Kolaczyk, Eric
openaire +2 more sources
Improved Algorithm for Degree Bounded Survivable Network Design Problem
, 2009 We consider the Degree-Bounded Survivable Network Design Problem: the objective is to find a minimum cost subgraph satisfying the given connectivity requirements as well as the degree bounds on the vertices.
K. Chaudhuri +8 more
core +2 more sources
FEBS Letters, EarlyView.In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai +9 more
wiley +1 more source
On Domination Topological Indices of Graphs
International Journal of Analysis and Applications, 2020 Topological indices and domination in graphs are the essential topics in the theory of graphs. A set of vertices D ⊆ V (G) is said to be a dominating set for G if any vertex v ∈ V − D is adjacent to some vertex u ∈ D.
A.M. Hanan Ahmed +2 more
doaj
Reducing the maximum degree of a graph by deleting vertices: the extremal cases
Theory and Applications of Graphs, 2018 Let $\lambda(G)$ denote the smallest number of vertices that can be removed from a non-empty graph $G$ so that the resulting graph has a smaller maximum degree. In a recent paper, we proved that if $n$ is the number of vertices of $G$, $k$ is the maximum
Peter Borg, Kurt Fenech
doaj +1 more source
FEBS Letters, EarlyView.Structural and biochemical characterisations show that the planar cell polarity (PCP) protein Inturned harbours a unique PDZ‐like domain that does not bind canonical PDZ‐binding motifs (PBMs) like that of another PCP protein Vangl2. In contrast, the apical‐basal polarity protein Scribble contains four PDZ domains that bind Vangl2, but one PDZ domain ...
Stephan Wilmes +4 more
wiley +1 more source
A Formal Treatment of Generalized Preferential Attachment and its Empirical Validation
, 2007 Generalized preferential attachment is defined as the tendency of a vertex to acquire new links in the future with respect to a particular vertex property.
A Herdağdelen +5 more
core +1 more source
The complexity of degree anonymization by vertex addition [PDF]
Theoretical Computer Science, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bredereck, Robert +5 more
openaire +2 more sources
FEBS Letters, EarlyView.Mitochondrial remodeling shapes neural and glial lineage progression by matching metabolic supply with demand. Elevated OXPHOS supports differentiation and myelin formation, while myelin compaction lowers mitochondrial dependence, revealing mitochondria as key drivers of developmental energy adaptation.
Sahitya Ranjan Biswas +3 more
wiley +1 more source