Results 151 to 160 of about 327 (176)
Some of the next articles are maybe not open access.
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
-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
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
Roman domination on strongly chordal graphs
Journal of Combinatorial Optimization, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chun-Hung Liu, Gerard J. Chang
openaire +2 more sources
Strengthening strongly chordal graphs
Discrete Mathematics, Algorithms and Applications, 2016An [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
The w‐median of a connected strongly chordal graph
Journal of Graph Theory, 1994AbstractSuppose G = (V, E) is a graph in which every vertex x has a non‐negative real number w(x) as its weight. The w‐distance sum of a vertex y is DG, w(y) = σx≅v d(y, x)w(x). The w‐median of G is the set of all vertices y with minimum w‐distance sum DG,w(y).
Hai-Yen Lee, Gerard J. Chang
openaire +2 more sources
Odd twists on strongly chordal graphs
Discrete Mathematics, Algorithms and Applications, 2019Strongly chordal graphs can be characterized as chordal graphs in which every even cycle of length at least [Formula: see text] has an odd chord (a chord whose endpoints are an odd distance apart in the cycle subgraph). Define “oddly chordal graphs” to be chordal graphs in which every odd cycle of length at least [Formula: see text] has an odd chord ...
openaire +1 more source
Steiner trees, connected domination and strongly chordal graphs
Networks, 1985AbstractWe consider Steiner tree problems and connected dominating set problems for several classes of graphs. We give a polynomial algorithm and a min‐max theorem for the cardinality Steiner problem in strongly chordal graphs and a polynomial algorithm for the weighted connected dominating set problem in series‐parallel graphs.
Kevin White 0001 +2 more
openaire +1 more source
A good characterization of squares of strongly chordal split graphs
Information Processing Letters, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Van Bang Le, Nguyen Ngoc Tuy
openaire +2 more sources
Partitioning Cliques of Claw-Free Strongly Chordal Graphs
1999In 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 +2 more sources