Results 181 to 190 of about 11,781 (210)
Spatial morphoproteomic features predict disease states from tissue architectures. [PDF]
iScienceHu T +9 more
europepmc +1 more source
Benders Decomposition Using Graph Modeling and Multi-Parametric Programming. [PDF]
Ind Eng Chem ResBrahmbhatt P +3 more
europepmc +1 more source
Billi: Provably Accurate and Scalable Bubble Detection in Pangenome Graphs
Bhat SG, Mahajan D, Jain C.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Connected Subgraph Fingerprints: Representing Molecules Using Exhaustive Subgraph Enumeration
Journal of Chemical Information and Modeling, 2019Molecular fingerprints are an efficient and widely used method for similarity-driven virtual screening. Most fingerprint methods can be distinguished by the class of structural features considered. The Connected Subgraph Fingerprint (CSFP) overcomes this limitation and regards all structural features of a compound.
Louis Bellmann +2 more
openaire +2 more sources
Spanning Halin Subgraphs Involving Forbidden Subgraphs
2016In structural graph theory, connectivity is an important notation with a lot of applications. Tutte, in 1961, showed that a simple graph is 3-connected if and only if it can be generated from a wheel graph by repeatedly adding edges between nonadjacent vertices and applying vertex splitting.
openaire +1 more source
Proceedings of the VLDB Endowment, 2017
Subgraph matching finds a set I of all occurrences of a pattern graph in a target graph. It has a wide range of applications while suffers an expensive computation. This efficiency issue has been studied extensively.
Miao Qiao, Hao Zhang, Hong Cheng
openaire +1 more source
Subgraph matching finds a set I of all occurrences of a pattern graph in a target graph. It has a wide range of applications while suffers an expensive computation. This efficiency issue has been studied extensively.
Miao Qiao, Hao Zhang, Hong Cheng
openaire +1 more source
Combinatorica, 1996
\(f(G)\) denotes the maximum number of edges in a bipartite subgraph of any simple graph \(G\); \(f(e)\) dentoes the minimum of \(f(G)\) as \(G\) ranges over all graphs \(G\) having \(e\) edges. Erdös has conjectured that \(\limsup_{e\to\infty} \Biggl(f(e)-{e\over 2}+{-1+\sqrt{8e+1}\over 8}\Biggr)=\infty\). Theorem 1.1. There exist a positive constant \
openaire +1 more source
\(f(G)\) denotes the maximum number of edges in a bipartite subgraph of any simple graph \(G\); \(f(e)\) dentoes the minimum of \(f(G)\) as \(G\) ranges over all graphs \(G\) having \(e\) edges. Erdös has conjectured that \(\limsup_{e\to\infty} \Biggl(f(e)-{e\over 2}+{-1+\sqrt{8e+1}\over 8}\Biggr)=\infty\). Theorem 1.1. There exist a positive constant \
openaire +1 more source
Subgraph Reconstruction via Reversible Subgraph Embedding
2023Boyu Yang, Weiguo Zheng
openaire +1 more source
2009
The amount of available data is increasing very fast. With this data, the desire for data mining is also growing. More and larger databases have to be searched to find interesting (and frequent) elements and connections between them. Most often the data of interest is very complex.
openaire +1 more source
The amount of available data is increasing very fast. With this data, the desire for data mining is also growing. More and larger databases have to be searched to find interesting (and frequent) elements and connections between them. Most often the data of interest is very complex.
openaire +1 more source