Results 161 to 170 of about 453 (193)

Bacterial cell wall-specific nanomedicine for the elimination of Staphylococcus aureus and Pseudomonas aeruginosa through electron-mechanical intervention. [PDF]

Nat Commun
You Y, Yu X, Jiang J, Chen Z, Zhu YX, Chen Y, Lin H, Shi J.   +7 more
europepmc   +1 more source

Integrated Multi-Omics and Machine Learning Framework Identifies Diagnostic Signatures and Druggable Targets in Breast Cancer. [PDF]

Genes (Basel)
Wang Z, Hou J, Chen Y, Li J, Vengusamy S.   +4 more
europepmc   +1 more source

Comprehensive profiling of chemokine and NETosis-associated genes in sarcopenia: construction of a machine learning-based diagnostic nomogram. [PDF]

Front Med (Lausanne)
Wang Y, Wang L, Zhang Y, Wang M, Zhao H, Huang C, Cai H, Mo S.   +7 more
europepmc   +1 more source

Deciphering hub genes and immune landscapes related to neutrophil extracellular traps in rheumatoid arthritis: insights from integrated bioinformatics analyses and experiments. [PDF]

Front Immunol
Li Y, Liu J, Sun Y, Hu Y, Zhou Q, Cong C, Chen Y.   +6 more
europepmc   +1 more source

Erratum to “Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs” [Discrete Mathematics 260 (2003) 231–238]

Discrete Mathematics
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Algorithms for Generating Strongly Chordal Graphs

Lecture Notes in Computer Science, 2021
Graph generation serves many useful purposes: cataloguing, testing conjectures, to which we would like to add that of producing test instances for graph algorithms. Strongly chordal graphs are a subclass of chordal graphs for which polynomial-time algorithms could be designed for problems which are NP-complete for the parent class of chordal graphs. In
Asish Mukhopadhyay, Mukhopadhyay Asish
exaly   +2 more sources

Broadcast domination and multipacking in strongly chordal graphs

Discrete Applied Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Richard C Brewster, Gary Macgillivray
exaly   +2 more sources

-labeling of dually chordal graphs and strongly orderable graphs

Information Processing Letters, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
B S Panda
exaly   +3 more sources

Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs

SIAM Journal on Computing, 1999
Summary: We study the parameterized complexity of three NP-hard graph completion problems. The minimum fill-in problem asks if a graph can be triangulated by adding at most \(k\) edges. We develop \(O(c^k m)\) and \(O(k^2 mn+f(k))\) algorithms for this problem on a graph with \(n\) vertices and \(m\) edges. Here \(f(k)\) is exponential in \(k\) and the
Haim Kaplan, Ron Shamir, Robert E Tarjan   +2 more
exaly   +2 more sources