Results 71 to 80 of about 1,906 (145)
Frequent Subgraph Mining in Outerplanar Graphs [PDF]
, 2010 In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining problem for tree datasets can be solved in incremental polynomial time, it ...
Horvath, Tamas +2 more
core +1 more source
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
Location in maximal outerplanar graphs
, 2017 In this work we study the metric dimension and the location-domination number of maximal outerplanar graphs. Concretely, we determine tight upper and lower bounds on the metric dimension and characterize those maximal outerplanar graphs attaining the lower bound. We also give a lower bound on the location-domination number
Claverol Aguas, Mercè +6 more
openaire +1 more source
Distance domination, guarding and vertex cover for maximal outerplanar\n graph [PDF]
, 2013 Santiago Canales +3 more
openalex +2 more sources
Dominating sets of maximal outerplanar graphs
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Non-Preemptive Tree Packing. [PDF]
Algorithmica, 2023 Lendl S, Woeginger G, Wulf L.
europepmc +1 more source
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
Clustering systems of phylogenetic networks. [PDF]
Theory Biosci, 2023 Hellmuth M, Schaller D, Stadler PF.
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
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