Results 71 to 80 of about 124 (114)
A branch-and-cut algorithm for the target visitation problem
EURO Journal on Computational Optimization, 2019 In this paper, we consider the target visitation problem (TVP) which arises in the context of disaster treatment. Mathematically speaking, the problem is concerned with finding a route to visit a set of targets starting from and returning to some base ...
Achim Hildenbrandt
doaj +1 more source
Game Chromatic Number of Graphs
, 1998 We show that if a graph has acyclic chromatic number k, then its game chromatic number is at most k(k + 1). By applying the known upper bounds for the acyclic chromatic numbers of various classes of graphs, we obtain upper bounds for the game chromatic ...
Xuding Zhu, Thomas Dinski
core
Exploring Unknown Environments
, 1997 . We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connected graph.
Monika R. Henzinger +3 more
core
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. [PDF]
Algorithmica, 2023 Misra P, Saurabh S, Sharma R, Zehavi M.
europepmc +1 more source
A note on lower bounds for the total domination number of digraphs
, 2017 A vertex subset S of a digraph D is called a dominating set of D if every vertex not in S is adjacent from at least one vertex in S. A dominating set S of D is called a total dominating set of D if the subdigraph of D induced by S has no isolated ...
Chen, Xiaodan, Hao, Guoliang
core
A new bound for the spectral radius of Brualdi-Li matrices
Special Matrices, 2015 Let B2m denote the Brualdi-Li matrix of order 2m, and let ρ2m = ρ(B2m ) denote the spectral radius of the Brualdi-Li Matrix ...
Chen Xiaogen
doaj +1 more source
The hybrid number of a ploidy profile. [PDF]
J Math Biol, 2022 Huber KT, Maher LJ.
europepmc +1 more source
Open MathematicsLet T(X) be a full transformation semigroup on a nonempty set X. The Cayley digraph Γ of a semigroup T(X) with respect to the Green’s L $\mathcal{L}$ -class is a digraph with vertex set T(X) and two vertices α, β ∈ T(X) are adjacent as an arc (α, β ...
Chaiya Yanisa +2 more
doaj +1 more source
Ramsey-Type Results for Oriented Trees
, 2007 . For a graph G and a digraph ~ H, we write G! ~ H (respectively, G a ! ~ H) if every orientation (respectively, acyclic orientation) of the edges of G results in an induced copy of ~ H. In this note we study how small the graphs G such that G!
Vojtech Rödl +2 more
core
Intake of Calanus finmarchicus oil for 12 weeks improves omega-3 index in healthy older subjects engaging in an exercise programme. [PDF]
Br J Nutr, 2021 Wasserfurth P +5 more
europepmc +1 more source