Results 161 to 170 of about 152,220 (203)

PROLONG: penalized regression for outcome guided longitudinal omics analysis with network and group constraints. [PDF]

Bioinformatics
Broll S, Basu S, Lee MH, Wells MT.
europepmc   +1 more source

Data reconstruction from machine learning models via inverse estimation and Bayesian inference. [PDF]

Sci Rep
Hartoyo A, Ciupek D, Malawski M, Crimi A.   +3 more
europepmc   +1 more source

Nonlinear control of a fully actuated robotic hand using high-order sliding mode and feedback linearization controllers. [PDF]

PLoS One
Sarwat A, Lu W, Iqbal M.
europepmc   +1 more source

Nonexistence Theorems of Perfect Codes and Tight Designs in Distance Transitive Graphs (デザインの構成法および不存在性)

Nonexistence Theorems of Perfect Codes and Tight Designs in Distance Transitive Graphs (デザインの構成法および不存在性)
openaire  

A Generalization of the Perfect Graph Theorem Under the Disjunctive Index

Mathematics of Operations Research, 2002
In this paper, we relate antiblocker duality between polyhedra, graph theory, and the disjunctive procedure. In particular, we analyze the behavior of the disjunctive procedure over the clique relaxation, 𝒦(G), of the stable set polytope in a graph G, and the one associated to its complementary graph, 𝒦(Ḡ).
Garaeila L. Nasini, Mariana S. Escalante, Néstor E. Aguilera   +2 more
semanticscholar   +5 more sources

Simple Proofs of the Strong Perfect Graph Theorem Using Polyhedral Approaches and Proving P=NP as a Conclusion

2020 International Conference on Computational Science and Computational Intelligence (CSCI), 2020
The strong perfect graph theorem is the proof of the famous Berge’s conjecture that the graph is perfect if and only if it is free of odd holes and odd anti-holes. The conjecture was settled after 40 years in 2002 by Maria Chudnovsky et. al. and the proof was published in 2006.
Maher Heal
semanticscholar   +4 more sources

The Strong Perfect Graph Theorem for a Class of Partitionable Graphs

, 1984
A simple adjacency criterion is presented which, when satisfied, implies that a minimal imperfect graph is an odd hole or an odd antihole. For certain classes of graphs, including K 1,3 -free graphs, it is straightforward to validate this criterion and thus establish the Strong Perfect Graph Theorem for such graphs.
Alan Tucker, Rick Giles, Leslie E. Trotter   +2 more
semanticscholar   +4 more sources

On the Perfect Graph Theorem

, 1973
D. R. Fulkerson
semanticscholar   +3 more sources

A Combinatorial Theorem on Ordered Circular Sequences of n 1 u's and n 2 v' s with Application to Kernel-perfect Graphs

Acta Mathematicae Applicatae Sinica, English Series, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiao-feng Guo, Yi Huang
  +6 more sources