相关论文: PHORMA: Perfectly Hashed Order Restricted Multidim…
We call a digraph {\em $h$-semicomplete} if each vertex of the digraph has at most $h$ non-neighbors, where a non-neighbor of a vertex $v$ is a vertex $u \neq v$ such that there is no edge between $u$ and $v$ in either direction. This…
Call a simple graph $H$ of order $n$ well-separable, if by deleting a separator set of size $o(n)$ the leftover will have components of size at most $o(n)$. We prove, that bounded degree well-separable spanning subgraphs are easy to embed:…
Remora is a higher-order, rank-polymorphic array-processing programming language, in the same general class of languages as APL and J. It is intended for writing programs to be executed on parallel hardware. We provide an example-driven…
We introduce a suitable adapted ordering for the twisted N=2 superconformal algebra (i.e. with mixed boundary conditions for the fermionic fields). We show that the ordering kernels for complete Verma modules have two elements and the…
General treebank analyses are graph structured, but parsers are typically restricted to tree structures for efficiency and modeling reasons. We propose a new representation and algorithm for a class of graph structures that is flexible…
In real life, it is always an urge to reach our goal in minimum effort i.e., it should have a minimum constrained path. The path may be shortest route in practical life, either physical or electronic medium. The scenario is to represents…
Inspired by a famous characterization of perfect graphs due to Lov\'{a}sz, we define a graph $G$ to be sum-perfect if for every induced subgraph $H$ of $G$, $\alpha(H) + \omega(H) \geq |V(H)|$. (Here $\alpha$ and $\omega$ denote the…
We consider the problem of storing a dynamic string $S$ over an alphabet $\Sigma=\{\,1,\ldots,\sigma\,\}$ in compressed form. Our representation supports insertions and deletions of symbols and answers three fundamental queries:…
Let $\Gamma$ be a finite simple graph. If for some integer $n\geqslant 4$, $\Gamma$ is a $K_n$-free graph whose complement has an odd cycle of length at least $2n-5$, then we say that $\Gamma$ is an $n$-exact graph. For a finite group $G$,…
Let $H_n$ be a graph on $n$ vertices and let $\ber{H_n}$ denote the complement of $H_n$. Suppose that $\Delta = \Delta(n)$ is the maximum degree of $\ber{H_n}$. We analyse three algorithms for sampling $d$-regular subgraphs ($d$-factors) of…
Path homology plays a central role in digraph topology and GLMY theory more general. Unfortunately, the computation of the path homology of a digraph $G$ is a two-step process, and until now no complete description of even the underlying…
Semi-random processes involve an adaptive decision-maker, whose goal is to achieve some predetermined objective in an online randomized environment. They have algorithmic implications in various areas of computer science, as well as…
Square relative non-zero sum Heffter arrays, denoted by $\mathrm{N}\mathrm{H}_t(n;k)$, have been introduced as a variant of the classical concept of Heffter array. An $\mathrm{N}\mathrm{H}_t(n; k)$ is an $n\times n$ partially filled array…
Understanding the local behaviour of structured multi-dimensional data is a fundamental problem in various areas of computer science. As the amount of data is often huge, it is desirable to obtain sublinear time algorithms, and specifically…
Constraint Satisfaction Problem (CSP) is a fundamental algorithmic problem that appears in many areas of Computer Science. It can be equivalently stated as computing a homomorphism $\mbox{$\bR \rightarrow \bGamma$}$ between two relational…
Constrained codes are used to prevent errors from occurring in various data storage and data transmission systems. They can help in increasing the storage density of magnetic storage devices, in managing the lifetime of electronic storage…
Given a $\{0,1\}$-matrix $M$, the graph realization problem for $M$ asks if there exists a spanning forest such that the columns of $M$ are incidence vectors of paths in the forest. The problem is closely related to the recognition of…
An $(n,k)$-perfect sequence covering array with multiplicity $\lambda$, denoted PSCA$(n,k,\lambda)$, is a multiset whose elements are permutations of the sequence $(1,2, \dots, n)$ and which collectively contain each ordered length $k$…
Recently, linear codes constructed from defining sets have been studied extensively. They may have nice parameters if the defining set is chosen properly. Let $ m >2$ be a positive integer. For an odd prime $ p $, let $ r=p^m $ and…
A hamiltonian sequence is a path walk $P$ that can be a hamiltonian path or hamiltonian circuit. Determining whether such hamiltonian sequence exists in a given graph \G is a NP-Complete problem. In this paper, a novel algorithm for…