相关论文: Pi/2-Angle Yao Graphs are Spanners
We introduce and study a loopless multigraph associated with a split graph $S$: the factor graph of $S$, denoted by $\Phi(S)$, which encodes the combinatorial information about 2-switch transformations over $S$. This construction provides a…
This paper presents a novel planar phased array that can work in Ka band designed for two-dimensional scanning. A four-modes pattern reconfigurable element based on microstrip Yagi antenna is proposed, and then developed into the 4X4 phased…
This paper proves that for each positive integer $m$, there is a planar graph $G$ which is not $(4m+\lfloor \frac{2m-1}{9}\rfloor,m)$-choosable. Then we pose some conjectures concerning multiple list colouring of planar graphs.
A roundtrip spanner of a directed graph $G$ is a subgraph of $G$ preserving roundtrip distances approximately for all pairs of vertices. Despite extensive research, there is still a small stretch gap between roundtrip spanners in directed…
Planar N=4 supersymmetric Yang-Mills theory appears to be perturbatively integrable. This work reviews integrability in terms of a Yangian algebra and compares the application to the problems of anomalous dimensions and scattering…
We study the large N expansion of a family of matrix models related to topological strings on toric Calabi-Yau threefolds. These matrix models compute spectral observables of underlying operators obtained by quantizing the mirror curves.…
A balanced graph is a bipartite graph with no induced circuit of length 2 mod 4. These graphs arise in linear programming. We focus on graph-algebraic properties of balanced graphs to prove a complete classification of balanced Cayley…
A $k$-additive spanner of a graph is a subgraph that preserves the distance between any two nodes up to a total additive error of $+k$. Efficient algorithms have been devised for constructing 2 [Aingworth et al. SIAM '99], 6 [Baswana et al.…
We present a simple greedy procedure to compute an $(\alpha,\beta)$-spanner for a graph $G$. We then show that this procedure is useful for building fault-tolerant spanners, as well as spanners for weighted graphs. Our first main result is…
The planar scattering amplitudes of $\mathcal{N} = 4$ super-Yang--Mills theory display symmetries and structures which underlie their relatively simple analytic properties such as having only logarithmic singularities and no poles at…
The traces over infinite dimensional representations of the central extended Yangian double for the product of operators which intertwine these representations are calculated. For the special combinations of the intertwining operators the…
We show that the stretch factor $\lambda(f)$ of an orientation-reversing fully-punctured pseudo-Anosov map $f$ on a finite-type orientable surface $S$, with $-\chi(S) \geq 4$ and having at least two puncture orbits, satisfies the inequality…
The dilatation operator of planar N=4 super Yang-Mills in the pure scalar SO(6) sector is derived at the two-loop order. Representation theory allows for eight free coefficients in an ansatz for the corresponding spin-chain hamiltonian…
We prove that any planar graph on $n$ vertices has less than $O(5{.}2852^n)$ spanning trees. Under the restriction that the planar graph is 3-connected and contains no triangle and no quadrilateral the number of its spanning trees is less…
We give a cohomological characterisation of expander graphs, and use it to give a direct proof that expander graphs do not have Yu's property A.
A tree $\sigma$-spanner of a positively real-weighted $n$-vertex and $m$-edge undirected graph $G$ is a spanning tree $T$ of $G$ which approximately preserves (i.e., up to a multiplicative stretch factor $\sigma$) distances in $G$. Tree…
Motivated by multipath routing, we introduce a multi-connected variant of spanners. For that purpose we introduce the $p$-multipath cost between two nodes $u$ and $v$ as the minimum weight of a collection of $p$ internally vertex-disjoint…
Given a set $P$ of $n$ points in the plane, we solve the problems of constructing a geometric planar graph spanning $P$ 1) of minimum degree 2, and 2) which is 2-edge connected, respectively, and has max edge length bounded by a factor of 2…
Projective two-weight linear codes are closely related to finite projective spaces and strongly regular graphs. In this paper, a family of $q$-ary projective two-weight linear codes is presented, where $q$ is a power of 2. The parameters of…
We show that a doubling measure on the plane can give positive measure to the graph of a continuous function. This answers a question by Wang, Wen and Wen. Moreover we show that the doubling constant of the measure can be chosen to be…