Results 151 to 160 of about 331 (182)

A graph modification approach for finding core-periphery structures in protein interaction networks. [PDF]

Algorithms Mol Biol, 2015
Bruckner S, Hüffner F, Komusiewicz C.
europepmc   +1 more source

Strategy Complexity of Reachability in Countable Stochastic 2-Player Games. [PDF]

Dyn Games Appl
Kiefer S, Mayr R, Shirmohammadi M, Totzke P.   +3 more
europepmc   +1 more source

Coloring graphs with forbidden induced subgraphs

, 2018
Maria Chudnovsky
openalex   +1 more source

Machine Learning-Driven Design of Fluorescent Materials: Principles, Methodologies, and Future Directions. [PDF]

Nanomaterials (Basel)
Bian Q, Wang X.
europepmc   +1 more source

Machine learning models for drug-drug interaction prediction from computational discovery to clinical application. [PDF]

NPJ Digit Med
Lu Y, Chen J, Fan N, Song W, Sheng H, Yang Y, Wang J.   +6 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Forbidden Induced Subgraphs for Perfect Matchings

Graphs and Combinatorics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ota, Katsuhiro, Sueiro, Gabriel
openaire   +1 more source

Forbidden induced subgraph characterization of cograph contractions

Journal of Graph Theory, 2004
AbstractLet S1, S2,…,St be pairwise disjoint non‐empty stable sets in a graph H. The graph H* is obtained from H by: (i) replacing each Si by a new vertex qi; (ii) joining each qi and qj, 1 ≤ i # j ≤ t, and; (iii) joining qi to all vertices in H – (S1 ∪ S2 ∪ ··· ∪ St) which were adjacent to some vertex of Si. A cograph is a P4‐free graph.
Zverovich, Igor Ed., Zverovich, Inessa I.   +1 more
openaire   +2 more sources