Results 161 to 170 of about 996,556 (196)

Metal-Modified Biochar Activates Persulfate for the Removal of Phenolic Pollutants from Water: Mechanism Prediction and Non-Radical Targeted Regulation. [PDF]

Toxics
Wei W, Cao W, Qu R, Wang Z.
europepmc   +1 more source

Construction and evaluation of a model based on clinical factors and multimodal ultrasound parameters for diagnosing postpartum pelvic floor myofascial pain. [PDF]

Quant Imaging Med Surg
Wang L, Wu X, Liu S, Lyu G, Lin X, Huang Y, Liu Z, He S.   +7 more
europepmc   +1 more source

A fusion-based multiomics classification approach for enhanced gene discovery in non-small cell lung cancer.

Bioinform Adv
Dwivedi K, Mahbod A, Ecker RC, Janjić K.   +3 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Finding a Maximum Independent Set

SIAM Journal on Computing, 1977
We present an algorithm which finds a maximum independent set in an n-vertex graph in 0($2^{n/3}$) time. The algorithm can thus handle graphs roughly three times as large as could be analyzed using a naive algorithm.
Robert Endre Tarjan
exaly   +2 more sources

Finding a maximum set of independent chords in a circle [PDF]

Information Processing Letters, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ruei Chuan Chang, Hsuan-Shih Lee
openaire   +3 more sources

Algorithms for a maximum clique and a maximum independent set of a circle graph

Networks, 1973
AbstractConsider a family of chords in a circle. A circle graph is obtained by representing each chord by a vertex, two vertices being connected by an edge when the corresponding chords intersect. In this paper, we describe efficient algorithms for finding a maximum clique and a maximum independent set of circle graphs. These algorithms require at most
exaly   +3 more sources

Maximum Independent Sets and Supervised Learning

Journal of the Operations Research Society of China, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Roberto Montemanni, Derek H. Smith, Xiaochen Chou   +2 more
openaire   +4 more sources

Maximum Renamable Horn and Maximum Independent Sets

2009 WRI World Congress on Computer Science and Information Engineering, 2009
A clause set is renamable Horn if the result replacing part propositional variable with its complement is a set of Horn clauses. The renamable Horn problem is solvable in linear time, but the maximum renamable Horn problem (MAX-RHS) is NP-hard. In this paper, we present transformations between clause sets and undirected graphs in polynomial time, such ...
Yongbin Qin, Daoyun Xu
openaire   +1 more source