Computing the clique number of tournaments
The clique number of a tournament is the maximum clique number of a graph formed by keeping backwards arcs in an ordering of its vertices. We study the time complexity of computing the clique number of a tournament and prove that, for any integer $k \geq 3$, deciding whether a tournament has clique number at most $k$ is NP-complete.
openaire +1 more source
Revealing the Hidden Social Structure of Pigs with AI-Assisted Automated Monitoring Data and Social Network Analysis. [PDF]
Animals (Basel)Agha S +5 more
europepmc +1 more source
Enumeration Approach to Atom-to-Atom Mapping Accelerated by Ising Computing. [PDF]
J Chem Inf ModelAli M +4 more
europepmc +1 more source
HemaCisDB: An Interactive Database for Analyzing Cis-regulatory Elements Across Hematopoietic Malignancies. [PDF]
Genomics Proteomics BioinformaticsCai X, Zhang Q, Liu B, Sun L, Liu Y.
europepmc +1 more source
A topic dissemination model based on hypernetwork. [PDF]
Sci RepHan ZM, Liu Y, Zhang SQ, An YQ.
europepmc +1 more source
Clinical Evaluation of a Combination of Non-Invasive Technologies to Improve the Effectiveness of Postpartum Abdominal Treatment. [PDF]
J Cosmet DermatolJun HLF +8 more
europepmc +1 more source
Persistent Directed Flag Laplacian (PDFL)-Based Machine Learning for Protein-Ligand Binding Affinity Prediction. [PDF]
J Chem Theory ComputZia M, Jones B, Feng H, Wei GW.
europepmc +1 more source
On the order and the number of cliques in a random graph
, 1997 Daniel Olejár, Eduard Toman
openalex +1 more source
Optimization of connection patterns between mobile phones and base stations using quantum annealing. [PDF]
Sci RepTakabayashi T +4 more
europepmc +1 more source