Results 171 to 180 of about 55,028 (193)
The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs [PDF]
FAW-AAIM, 2011 Given a graph G and integers b and w. The black-and-white coloring problem asks if there exist disjoint sets of vertices B and W with |B|=b and |W|=w such that no vertex in B is adjacent to any vertex in W .
T. Kloks +3 more
semanticscholar +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Roman domination on strongly chordal graphs
Journal of Combinatorial Optimization, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chun-Hung Liu, G. Chang
semanticscholar +3 more sources
Strong clique trees, neighborhood trees, and strongly chordal graphs
Journal of Graph Theory, 2000Terry A Mckee
exaly +2 more sources
A simple linear time algorithm for the domatic partition problem on strongly chordal graphs
Information Processing Letters, 1992Maw-Shang Chang
exaly +2 more sources
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.
K. White, M. Farber, W. Pulleyblank
semanticscholar +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
Complexity Analysis of Triangular Decomposition over F_2 with Strongly Chordal Graphs
International Symposium on Symbolic and Algebraic ComputationIn this paper, we first introduce a new vertex order of graphs called the substrong elimination ordering based on maximal cliques of the graphs and prove that such an ordering can fully characterize strongly chordal graphs.
Zhaoxing Qi, Chenqi Mou
semanticscholar +1 more source
On Generating Strong Elimination Orderings of Strongly Chordal Graphs
Foundations of Software Technology and Theoretical Computer Science, 1998We present a conceptually simple algorithm to generate an ordering of the vertices of an undirected graph. The ordering generated turns out to be a strong elimination ordering if and only if the given graph is a strongly chordal graph. This algorithm makes use of maximum cardinality search and lexicographic breadth first search algorithms which are ...
N. K. Prasad, P. S. Kumar
semanticscholar +2 more sources
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