Results 1 to 10 of about 63,549 (264)

One Earth + One Health: An Agile, Evolutionary, System-of-Systems Convergence Paradigm. [PDF]

Environ Sci Technol
Little JC, Kaaronen RO, Muthukrishna M, Elsawah S, Bennett MS, Khayal I, Hukkinen JI, Barton CM, Jakeman AJ, Farid AM.   +9 more
europepmc   +1 more source

Scalable multi-objective genetic algorithm for quantum circuit optimization. [PDF]

Sci Rep
Ghlib R, Bouhadouza R, Hnaien F.
europepmc   +1 more source

AI and Machine Learning for Proteomics-Driven Drug Discovery: Methods, Tools, and Best Practices. [PDF]

Curr Issues Mol Biol
Basak S.
europepmc   +1 more source

Graph orientation with splits

Theoretical Computer Science, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yuichi Asahiro, Jesper Jansson 0001, Eiji Miyano, Hesam Nikpey, Hirotaka Ono 0001   +4 more
openaire   +1 more source

Transitive Orientations of Graphs

SIAM Journal on Computing, 1988
Consider an acyclic orientation of the edges of a graph G of order n and relative size p. The partial order obtained by transitive closure is called the transitive orientation of G. Let t(G) be the maximum number of unrelated pairs for different orders, and t(n,p) its minimum over G for fixed n and p. Bounds on t(n,p) are given throughout the range of \
Béla Bollobás, Graham R. Brightwell
openaire   +2 more sources

On the orientation of meyniel graphs

Journal of Graph Theory, 1994
AbstractA kernel of a directed graph is a set of vertices K that is both absorbant and independent (i.e., every vertex not in K is the origin of an arc whose extremity is in K, and no arc of the graph has both endpoints in K). In 1983, Meyniel conjectured that any perfect graph, directed in such a way that every circuit of length three uses two ...
Mostafa Blidia, Pierre Duchet, Frédéric Maffray   +2 more
openaire   +1 more source

Orientations of circle graphs

Journal of Graph Theory, 1982
AbstractLet C(v1, …,vn) be a system consisting of a circle C with chords v1, …,vn on it having different endpoints. Define a graph G having vertex set V(G) = {v1, …,vn} and for which vertices vi and vj are adjacent in G if the chords vi and vj intersect. Such a graph will be called a circle graph.
Ronald C. Read, Doron Rotem, Jorge Urrutia   +2 more
openaire   +1 more source

Bipartitions of oriented graphs

Journal of Combinatorial Theory, Series B, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianfeng Hou, Shufei Wu
openaire   +2 more sources