Search results for "Chordal graph"
showing 4 items of 14 documents
Algorithms on Graphs
1988
In this chapter we shall develop some basic algorithms for directed graphs and relations which will be of use in later chapters, where the efficient construction of parsers is considered. The constructions needed can be expressed as the computing of certain “relational expressions”. These are expressions whose operands are relations and whose operators are chosen from among multiplication, closure, union and inverse. For this purpose we need to develop an algorithm for computing the closure of a relation. In view of the nature of our applications, the most appropriate way to do this is by a depth-first traversal of the graph that corresponds to the given relation. Other ways of computing th…
Dirichlet approximation and universal Dirichlet series
2016
We characterize the uniform limits of Dirichlet polynomials on a right half plane. In the Dirichlet setting, we find approximation results, with respect to the Euclidean distance and {to} the chordal one as well, analogous to classical results of Runge, Mergelyan and Vitushkin. We also strengthen the notion of universal Dirichlet series.
Spatial Search by Quantum Walk is Optimal for Almost all Graphs.
2015
The problem of finding a marked node in a graph can be solved by the spatial search algorithm based on continuous-time quantum walks (CTQW). However, this algorithm is known to run in optimal time only for a handful of graphs. In this work, we prove that for Erd\"os-Renyi random graphs, i.e.\ graphs of $n$ vertices where each edge exists with probability $p$, search by CTQW is \textit{almost surely} optimal as long as $p\geq \log^{3/2}(n)/n$. Consequently, we show that quantum spatial search is in fact optimal for \emph{almost all} graphs, meaning that the fraction of graphs of $n$ vertices for which this optimality holds tends to one in the asymptotic limit. We obtain this result by provin…
Tuning continua and keyboard layouts
2008
Previous work has demonstrated the existence of keyboard layouts capable of maintaining consistent fingerings across a parametrized family of tunings. This paper describes the general principles underlying layouts that are invariant in both transposition and tuning. Straightforward computational methods for determining appropriate bases for a regular temperament are given in terms of a row-reduced matrix for the temperament-mapping. A concrete description of the range over which consistent fingering can be maintained is described by the valid tuning range. Measures of the resulting keyboard layouts allow direct comparison of the ease with which various chordal and scalic patterns can be fin…