Results 231 to 240 of about 608,783 (278)
The MOGA multi-modal framework based on graph augmentation networks for drug response prediction. [PDF]
Zhang K, Wang R, Zang T, Zhao Y.
europepmc +1 more source
Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. [PDF]
Bentert M, Fomin FV, Golovach PA.
europepmc +1 more source
Multi-adaptive event-triggered consensus of positive multi-agent systems using pinning strategy. [PDF]
Li Q, Dong L, Yang H.
europepmc +1 more source
Post-selection inference for causal effects after causal discovery. [PDF]
Chang TH, Guo Z, Malinsky D.
europepmc +1 more source
Characterizing semi-directed phylogenetic networks and their multi-rootable variants. [PDF]
Holtgrefe N +4 more
europepmc +1 more source
Evidence-based directed acyclic graphs for perinatal pharmacoepidemiologic studies in rheumatology: a structured approach for development and implementation in administrative health data. [PDF]
Cheng V +5 more
europepmc +1 more source
To appear in STACS ...
Saket Saurabh +2 more
exaly +8 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
SIAM Journal on Discrete Mathematics, 1999
A property \(P\) of graphs is called monotone if it is preserved under the deletion of edges. Let \(\Delta^P_n\) denote the simplicial complex whose simplices are edge sets of \(n\)-vertex graphs having a monotone property \(P\). Topological properties of complexes of undirected graphs recently have been studied in a number of papers (see references in
Anders Björner, Volkmar Welker
openaire +1 more source
A property \(P\) of graphs is called monotone if it is preserved under the deletion of edges. Let \(\Delta^P_n\) denote the simplicial complex whose simplices are edge sets of \(n\)-vertex graphs having a monotone property \(P\). Topological properties of complexes of undirected graphs recently have been studied in a number of papers (see references in
Anders Björner, Volkmar Welker
openaire +1 more source

