Results 31 to 40 of about 23,983 (294)
Simultaneous FPQ-ordering and hybrid planarity testing
We introduce and study a constrained planarity testing problem, called 1-FIXED CONSTRAINED PLANARITY, and prove that this problem can be solved in quadratic time for biconnected graphs.
Rutter I., Liotta G., Tappini A.
core +1 more source
Planar Earthmover is not in L_1 [PDF]
We show that any $L_1$ embedding of the transportation cost (a.k.a. Earthmover) metric on probability measures supported on the grid $\{0,1,\ldots,n\}^2 \subseteq \mathbb{R}^2$ incurs distortion $\Omega \left(\sqrt{\log n}\right)$. We also use Fourier analytic techniques to construct a simple $L_1$ embedding of this space which has distortion $O(\log n)
Assaf Naor, Gideon Schechtman
openaire +4 more sources
Hypervelocity impact in the universe can be generated by a three-stage gas gun. Achieving the desirable planarity of the flyer enlarges the experimentally effective area of the flyer under the hypervelocity condition.
Chengcheng Guo +7 more
doaj +1 more source
The development of the broadband antenna for ultrawideband (UWB) applications such as communications, imaging, radar, and localization is discussed. UWB systems are based on transmitting and receiving impulses with extremely wide spectra. As the antennas for UWB should have broad operating bandwidths for impedance matching and high-gain radiation in ...
Cheng, Zhi Ning +5 more
openaire +3 more sources
The error in the differentiation argument has been ...
Simeon Ball, Michel Lavrauw
openaire +7 more sources
Level-Planarity: Transitivity vs. Even Crossings [PDF]
The strong Hanani-Tutte theorem states that a graph is planar if and only if it can be drawn such that any two edges that do not share an end cross an even number of times. Fulek et al.
Brückner, Guido +2 more
core +1 more source
Planar lattices and planar graphs
AbstractIt is shown that a finite lattice is planar if and only if the (undirected) graph obtained from its (Hasse) diagram by adding an edge between its least and greatest elements is a planar graph.
openaire +2 more sources
We introduce the family of $k$-gap-planar graphs for $k \geq 0$, i.e., graphs that have a drawing in which each crossing is assigned to one of the two involved edges and each edge is assigned at most $k$ of its crossings. This definition is motivated by applications in edge casing, as a $k$-gap-planar graph can be drawn crossing-free after introducing ...
Sang Won Bae 0001 +10 more
openaire +5 more sources
The expected sum of edge lengths in planar linearizations of trees
Dependency trees have proven to be a very successful model to represent the syntactic structure of sentences of human languages. In these structures, vertices are words and edges connect syntacticallydependent words.
Lluís Alemany-Puig +1 more
doaj +1 more source
Noise modeling and depth calibration for Time-Of-Flight cameras
thesis extended ...
Amira Belhedi
doaj +1 more source

