Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Wu, Yaokun"'
In 1998, B\"{o}cker and Dress gave a 1-to-1 correspondence between symbolically dated rooted trees and symbolic ultrametrics. We consider the corresponding problem for unrooted trees. More precisely, given a tree $T$ with leaf set $X$ and a proper ve
Externí odkaz:
http://arxiv.org/abs/1702.00190
Autor:
Wu, Yaokun, Zhang, Chengpeng
Let $G$ be a connected graph with the usual shortest-path metric $d$. The graph $G$ is $\delta$-hyperbolic provided for any vertices $x,y,u,v$ in it, the two larger of the three sums $d(u,v)+d(x,y),d(u,x)+d(v,y)$ and $d(u,y)+d(v,x)$ differ by at most
Externí odkaz:
http://arxiv.org/abs/0910.3544
Autor:
Wang, Xinmao, Wu, Yaokun
A configuration of a graph is an assignment of one of two states, on or off, to each vertex of it. A regular move at a vertex changes the states of the neighbors of that vertex. A valid move is a regular move at an on vertex. The following result is
Externí odkaz:
http://arxiv.org/abs/0904.3050
Autor:
Wu, Yaokun, Deng, Aiping
The Optical Transpose Interconnection System (OTIS) was proposed by Marsden et al. [Opt. Lett 18 (1993) 1083--1085] to implement very dense one-to-one interconnection between processors in a free space of optical interconnections. The system which al
Externí odkaz:
http://arxiv.org/abs/math/0303311