Results 141 to 150 of about 3,915 (163)

Analysis of the Correlation Between Cuproptosis and Instability of Atherosclerotic Plaques. [PDF]

Biomedicines
Muhetaer M, He T, Zhu H, Wu J, Wan J, Zhang T, Hu Y, Lu Z, Cai H.   +8 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

Targeting ferroptosis reveals a new strategy for breast cancer treatment: a bibliometric study. [PDF]

Discov Oncol
Liu J, Tang R, Zheng J, Luo K.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Roman domination on strongly chordal graphs

Journal of Combinatorial Optimization, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, Chun-Hung, Chang, Gerard J.
openaire   +2 more sources

Algorithms for Generating Strongly Chordal Graphs

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, Md. Zamilur Rahman
openaire   +1 more source

Strengthening strongly chordal graphs

Discrete Mathematics, Algorithms and Applications, 2016
An [Formula: see text]-chord of a cycle [Formula: see text] is a chord that forms a new cycle with a length-[Formula: see text] subpath of [Formula: see text] when [Formula: see text] is at most half the length of [Formula: see text]. Define a graph to be [Formula: see text]-strongly chordal if, for every [Formula: see text], every cycle long enough ...
openaire   +1 more source

Partitioning Cliques of Claw-Free Strongly Chordal Graphs

1999
In this paper we find a particular partition of the vertex set of claw-free strongly chordal graphs in which each element is a clique, and we show that the adjacency graph of these cliques is a tree. In particular, the presented results imply the existence of an ordering of the vertices, and a corresponding edge orientation, such that each directed ...
Confessore, G, Dell'Olmo, P, GIORDANI, STEFANO   +2 more
openaire   +2 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
Kaplan, Haim, Shamir, Ron, Tarjan, Robert E.   +2 more
openaire   +1 more source