Buscar
Mostrando ítems 21-30 de 491
THE COMPLEXITY OF APPROXIMATING THE ORIENTED DIAMETER OF CHORDAL GRAPHS
(SPRINGER, 2002)
The oriented diameter of a (undirected) graph G is the smallest diameter among all the diameters of strongly connected orientations of G. We study algorithmic aspects of determining the oriented diameter of a chordal graph. ...
Improved algorithms for k-domination and total k-domination in proper interval graphs
(Springer, 2018-07)
Given a positive integer k, a k-dominating set in a graph G is a set of vertices such that every vertex not in the set has at least k neighbors in the set. A total k-dominating set, also known as a k-tuple total dominating ...
New algorithms for weighted k-domination and total k-domination problems in proper interval graphs
(Elsevier Science, 2019-11)
Given a positive integer k, a k-dominating set in a graph G is a set of vertices such that every vertex not in the set has at least k neighbors in the set. A total k-dominating set is a set of vertices such that every ...
On absolutely normal and continued fraction normal numbers
(Oxford University Press, 2017-12)
We give a construction of a real number that is normal to all integer bases and continued fraction normal. The computation of the firstn digits of its continued fraction expansion performs in the order ofn^4 mathematical ...
Exact Algorithms for Minimum Weighted Dominating Induced Matching
(Springer, 2017-03)
Say that an edge of a graph G dominates itself and every other edge sharing a vertex of it. An edge dominating set of a graph G= (V, E) is a subset of edges E′⊆ E which dominates all edges of G. In particular, if every ...
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
(ELSEVIER SCIENCE BV, 2009)
Let M = (V, E, A) be a mixed graph with vertex set V, edge set E and arc set A. A cycle cover of M is a family C = {C(1), ... , C(k)} of cycles of M such that each edge/arc of M belongs to at least one cycle in C. The ...