Results 151 to 160 of about 27,298 (312)
PLoS ONE, 2014 Subgraph matching algorithms are used to find and enumerate specific interconnection structures in networks. By enumerating these specific structures/subgraphs, the fundamental properties of the network can be derived.
Maarten Houbraken +5 more
doaj +1 more source
Discrete Mathematics, 1974 Let \(G\) and \(H\) be two simple graphs on \(g\) vertices. We give a sufficient condition, based on the minimum degree of the vertices of \(G\) and the maximum degree of the vertices of \(H\), for \(H\) to be a subgraph of \(G\).
openaire +2 more sources
Allocation of Indivisible Items With a Common Preference Graph: Minimizing Total Dissatisfaction
Networks, EarlyView.ABSTRACT Allocating indivisible items among a set of agents is a frequently studied discrete optimization problem. In the setting considered in this work, the agents' preferences over the items are assumed to be identical. We consider a very recent measure for the overall quality of an allocation which does not rely on numerical valuations of the items.
Nina Chiarelli +6 more
wiley +1 more source
Interdiction Models and Heuristics for Graph Propagation
Networks, EarlyView.ABSTRACT Given a graph G=(V,E)$$ G=\left(V,E\right) $$ and a set S⊂V$$ S\subset V $$ of activated/infected nodes, we consider the problem of determining the set of c$$ c $$ nodes that minimizes the network propagation on the subgraph that results from the removal of those c$$ c $$ nodes. To measure network propagation, we assume that a node i$$ i $$ is
Agostinho Agra, José Maria Samuco
wiley +1 more source
Randomly $C_{n} cup C_{m}$ graphs
Annales Universitatis Paedagogicae Cracoviensis: Studia Mathematica, 2007 A graph $G$ is said to be a randomly $H$ graph if and only if any subgraph of $G$ without isolated vertices, which is isomorphic to a subgraph of $H$, can be extended to a subgraph $F$ of $G$ such that $F$ is isomorphic to $H$.
Pavel Híc, Milan Pokorný
doaj
Mining contextually meaningful subgraphs from a vertex-attributed graph
BMC BioinformaticsNetworks have emerged as a natural data structure to represent relations among entities. Proteins interact to carry out cellular functions and protein-Protein interaction network analysis has been employed for understanding the cellular machinery ...
Riyad Hakim, Saeed Salem
doaj +1 more source
Link Prediction Based on Subgraph Evolution in Dynamic Social Networks
We propose a new method for characterizing the dynamics of complex networks with its application to the link prediction problem. Our approach is based on the discovery of network subgraphs (in this study: triads of nodes) and measuring their transitions ...
Musial, Katarzyna +2 more
core
Proteins: Structure, Function, and Bioinformatics, EarlyView.ABSTRACT The GTPase KRAS executes a conformational switch between a GTP‐bound active state and a GDP‐bound inactive state, a process central to oncogenic signaling. However, the structural basis of this switching at the level of residue‐contact organization remains incompletely characterized by traditional binary structural models.
Fatma Senguler Ciftci, Burak Erman
wiley +1 more source
Assessing Capability Complexity Using Enterprise Architecture Framework
Systems Engineering, EarlyView.ABSTRACT This study proposes a structured and quantitative methodology to evaluate the holistic complexity of system‐of‐systems (SoSs), employing the Zachman Architecture Framework (ZAF) as its foundational analytical tool. A five‐phase analytical procedure is developed and empirically validated, encompassing: (1) refinement of complexity measures, (2)
Javad Bakhshi, Mahmoud Efatmaneshnik
wiley +1 more source
Subgraph Induced Connectivity Augmentation [PDF]
, 2003 Given a planar graph G=(V,E) and a vertex set Wsubseteq V , the subgraph induced planar connectivity augmentation problem asks for a minimum cardinality set F of additional edges with end vertices in W such that G'=(V,Ecup F) is planar and the subgraph ...
Gutwenger, Carsten +5 more
core