Results 161 to 170 of about 444 (188)
Comparative Transcriptomic Analysis Underlies the Differential Virulence of <i>Vibrio harveyi</i> and <i>Vibrio vulnificus</i> in American Eels (<i>Anguilla rostrata</i>). [PDF]
Int J Mol SciYang Q +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Algorithms for Generating Strongly Chordal Graphs
Lecture Notes in Computer Science, 2021Graph 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
-labeling of dually chordal graphs and strongly orderable graphs
Information Processing Letters, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
B S Panda
exaly +3 more sources
Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs
Lecture Notes in Computer Science, 2002Chordal bipartite graphs are introduced to analyze nonsymmetric matrices, and form a large class of perfect graphs. There are several problems, which can be solved efficiently on the class using the characterization by the doubly lexical ordering ofthe bipartite adjacency matrix.
Ryuhei Uehara
exaly +2 more sources
Broadcast domination and multipacking in strongly chordal graphs
Discrete Applied Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Richard Brewster, Gary Macgillivray
exaly +2 more sources
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 +2 more
exaly +2 more sources
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 +2 more
exaly +2 more sources
Partitioning Cliques of Claw-Free Strongly Chordal Graphs [PDF]
, 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 +2 more
openaire +3 more sources