Results 71 to 80 of about 1,772 (132)
Centroidal localization game [PDF]
, 2018 One important problem in a network is to locate an (invisible) moving entity by using distance-detectors placed at strategical locations. For instance, the metric dimension of a graph $G$ is the minimum number $k$ of detectors placed in some vertices ...
Bosek, Bartłomiej +5 more
core +2 more sources
Algorithm on rainbow connection for maximal outerplanar graphs
Theoretical Computer Science, 2016 In this paper, we consider rainbow connection number of maximal outerplanar graphs(MOPs) on algorithmic aspect. For the (MOP) $G$, we give sufficient conditions to guarantee that $rc(G) = diam(G).$ Moreover, we produce the graph with given diameter $d$ and give their rainbow coloring in linear time. X.Deng et al.
Deng, Xingchao +2 more
openaire +2 more sources
Metric dimension of maximal outerplanar graphs
, 2019 Preprint
Claverol Aguas, Mercè +6 more
openaire +1 more source
Non-Preemptive Tree Packing. [PDF]
Algorithmica, 2023 Lendl S, Woeginger G, Wulf L.
europepmc +1 more source
Disjunctive domination in maximal outerplanar graphs
A disjunctive dominating set of a graph $G$ is a set $D \subseteq V(G)$ such that every vertex in $V(G)\setminus D$ has a neighbor in $D$ or has at least two vertices in $D$ at distance $2$ from it. The disjunctive domination number of $G$, denoted by $γ_2^d(G)$, is the minimum cardinality of a disjunctive dominating set of $G$.
Henning, Michael A. +2 more
openaire +2 more sources
Clustering systems of phylogenetic networks. [PDF]
Theory Biosci, 2023 Hellmuth M, Schaller D, Stadler PF.
europepmc +1 more source
Optimally edge-colouring outerplanar graphs is in NC [PDF]
We prove that every outerplanar graph can be optimally edge-coloured in polylogarithmic time using a polynomial number of processors on a parallel random access machine without write conflicts (P-RAM)
Gibbons, Alan (Alan M.) +1 more
core
Edge Roman domination on graphs
, 2014 An edge Roman dominating function of a graph $G$ is a function $f\colon E(G) \rightarrow \{0,1,2\}$ satisfying the condition that every edge $e$ with $f(e)=0$ is adjacent to some edge $e'$ with $f(e')=2$.
Chang, Gerard J. +2 more
core
The 2-center Problem in Maximal Outerplanar Graph
, 2022 We consider the problem of computing 2-center in maximal outerplanar graph. In this problem, we want to find an optimal solution where two centers cover all the vertices with the smallest radius. We provide the following result. We can compute the optimal centers and the optimal radius in $O(n^2)$ time for a given maximal outerplanar graph with $n ...
openaire +2 more sources
Colouring exact distance graphs of chordal graphs
, 2019 For a graph $G=(V,E)$ and positive integer $p$, the exact distance-$p$ graph $G^{[\natural p]}$ is the graph with vertex set $V$ and with an edge between vertices $x$ and $y$ if and only if $x$ and $y$ have distance $p$.
Quiroz, Daniel A.
core