Zobrazeno 1 - 10
of 106
pro vyhledávání: '"Palios, Leonidas"'
Consider a graph $G$ which belongs to a graph class ${\cal C}$. We are interested in connecting a node $w \not\in V(G)$ to $G$ by a single edge $u w$ where $u \in V(G)$; we call such an edge a \emph{tail}. As the graph resulting from $G$ after the ad
Externí odkaz:
http://arxiv.org/abs/2302.00657
The minimum completion (fill-in) problem is defined as follows: Given a graph family $\mathcal{F}$ (more generally, a property $\Pi$) and a graph $G$, the completion problem asks for the minimum number of non-edges needed to be added to $G$ so that t
Externí odkaz:
http://arxiv.org/abs/2302.00112
Let $r$ be a point in the first quadrant $Q_1$ of the plane $\mathbb{R}^2$ and let $P \subset Q_1$ be a set of points such that for any $p \in P$, its $x$- and $y$-coordinate is at least as that of $r$. A rectilinear Steiner arborescence for $P$ with
Externí odkaz:
http://arxiv.org/abs/2210.04576
We present an $O(nrG)$ time algorithm for computing and maintaining a minimum length shortest watchman tour that sees a simple polygon under monotone visibility in direction $\theta$, while $\theta$ varies in $[0,180^{\circ})$, obtaining the directio
Externí odkaz:
http://arxiv.org/abs/2007.08368
In the domain of software watermarking, we have proposed several graph theoretic watermarking codec systems for encoding watermark numbers $w$ as reducible permutation flow-graphs $F[\pi^*]$ through the use of self-inverting permutations $\pi^*$. Fol
Externí odkaz:
http://arxiv.org/abs/1812.11080
Publikováno v:
Theory of Computing Systems 63:3 (2019), 543-566
We study the problem of rotating a simple polygon to contain the maximum number of elements from a given point set in the plane. We consider variations of this problem where the rotation center is a given point or lies on a line segment, a line, or a
Externí odkaz:
http://arxiv.org/abs/1805.02570
Publikováno v:
Journal of Global Optimization (2021) 80, 887-920
Let $\mathcal{O}$ be a set of $k$ orientations in the plane, and let $P$ be a simple polygon in the plane. Given two points $p,q$ inside $P$, we say that $p$ $\mathcal{O}$-\emph{sees} $q$ if there is an $\mathcal{O}$-\emph{staircase} contained in $P$
Externí odkaz:
http://arxiv.org/abs/1802.05995
Several graph theoretic watermark methods have been proposed to encode numbers as graph structures in software watermarking environments. In this paper, we propose an efficient and easily implementable codec system for encoding watermark numbers as r
Externí odkaz:
http://arxiv.org/abs/1712.08482
For a given collection G of directed graphs we define the join-reachability graph of G, denoted by J(G), as the directed graph that, for any pair of vertices a and b, contains a path from a to b if and only if such a path exists in all graphs of G. O
Externí odkaz:
http://arxiv.org/abs/1012.4938
We consider polynomially and rationally parameterized curves, where the polynomials in the parameterization have fixed supports and generic coefficients. We apply sparse (or toric) elimination theory in order to determine the vertex representation of
Externí odkaz:
http://arxiv.org/abs/0811.0103