Results 51 to 60 of about 6,576,413 (265)

Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth [PDF]

, 2018
The girth of a graph is the length of its shortest cycle. Due to its relevance in graph theory, network analysis and practical fields such as distributed computing, girth-related problems have been object of attention in both past and recent literature. In this paper, we consider the problem of listing connected subgraphs with bounded girth. As a large
Kurita, Kazuhiro, Wasa, Kunihiro, Conte, Alessio, Uno, Takeaki, Arimura, Hiroki   +4 more
openaire   +3 more sources

Mendelian Randomization and Double Machine Learning Modeling Reveal Brain Imaging‐Derived Phenotypes as Functional Contributors to 18 Autoimmune Inflammatory Diseases

Advanced Science, EarlyView.
This schematic integrates the eight statistically significant causal relationships identified between 1,366 brain imaging‐derived phenotypes (IDPs) and 18 autoimmune inflammatory diseases (AIDs). Arrows indicate the direction of causality inferred from bidirectional two‐sample MR analyses.
Jinbin Chen, Xin Wang, Haifeng Ding, Bosheng Zheng, Keni Zeng, Chuying Hu, Jiayi Liu, Xiao Zhu, Haibing Yu   +8 more
wiley   +1 more source

The complexity of the connected graph access structure on seven participants

Journal of Mathematical Cryptology, 2017
In this paper, we study an important problem in secret sharing that determines the exact value or bound for the complexity. First, we use the induced subgraph complexity of the graph G with access structure Γ to obtain a lower bound on the complexity of ...
Hadian Dehkordi Massoud, Safi Ali
doaj   +1 more source

Induced Subgraphs With Many Distinct Degrees [PDF]

Combinatorics, Probability and Computing, 2017
Let hom(G) denote the size of the largest clique or independent set of a graphG. In 2007, Bukh and Sudakov proved that everyn-vertex graphGwith hom(G) =O(logn) contains an induced subgraph with Ω(n1/2) distinct degrees, and raised the question of deciding whether an analogous result holds for everyn-vertex graphGwith hom(G) =O(nϵ), whereϵ> 0 is a ...
Narayanan, Bhargav, Tomon, István
openaire   +3 more sources

Stamping Lithography on Arbitrary Surfaces based on Self‐Assembly of Colloidal Particles

Advanced Science, EarlyView.
A new method called Stamping Lithography for three‐dimensional (3D) circuits manufacturing is proposed, which comprises a resist mask stamping process based on self‐assembly of colloidal particles and a subsequent etching process. It replaces the photoresist with self‐assembled particles and the exposure process with stamping, making it feasible to ...
Guoxu Yu, Heyang Zhang, Yiming Li, Lele Song, Jinglin Jia, Lei Chen, Ding Weng, Yuan Ma, Jiadao Wang   +8 more
wiley   +1 more source

Motif-role-fingerprints: the building-blocks of motifs, clustering-coefficients and transitivities in directed networks. [PDF]

PLoS ONE, 2014
Complex networks are frequently characterized by metrics for which particular subgraphs are counted. One statistic from this category, which we refer to as motif-role fingerprints, differs from global subgraph counts in that the number of subgraphs in ...
Mark D McDonnell, Ömer Nebil Yaveroğlu, Brett A Schmerl, Nicolangelo Iannella, Nicolangelo Iannella, Lawrence M Ward   +5 more
doaj   +1 more source

Robust Densest Subgraph Discovery

, 2018
Dense subgraph discovery is an important primitive in graph mining, which has a wide variety of applications in diverse domains. In the densest subgraph problem, given an undirected graph $G=(V,E)$ with an edge-weight vector $w=(w_e)_{e\in E}$, we aim to
Miyauchi, Atsushi, Takeda, Akiko
core   +1 more source

Diversity, transfer potential, and transcriptional activity of virus‐carried antibiotic resistance genes in global estuaries

iMetaOmics, EarlyView.
Estuaries are vital hotspots for antibiotic resistance genes (ARGs) due to substantial antibiotic pollution. Although viruses have been proposed as key reservoirs and important disseminators of ARGs in environments, their contribution to the estuarine antibiotic resistome remains largely unknown.
Xiao‑Qing Luo, Xiyang Dong, Jia‑Ling Li, Ji‐Cheng Yao, Ziqi Peng, Qi Li, Zi‐Wen Yang, Yang Yuan, Wen‑Jun Li, Pandeng Wang   +9 more
wiley   +1 more source

Robustness Assessment of Public Transport Networks in Various Graph Representations: Systematic Review, Decision Support, and Case Study

Networks, EarlyView.
ABSTRACT The analysis of certain properties of the underlying graph of a public transport network generates insights about the network's structure. Hereby, the choice of the graph representation depends on a trade‐off between complexity reduction and information preservation to adequately model a public transport network.
Michael Palk, Stefan Voß, Raka Jovanovic   +2 more
wiley   +1 more source

Maximum common subgraph: some upper bound and lower bound results

BMC Bioinformatics, 2006
Background Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this process into a problem of finding a maximum common subgraph between graphical
Jennings Steven F, Lai Jing, Huang Xiuzhen   +2 more
doaj   +1 more source