Results 41 to 50 of about 20,236 (296)
An algorithm for an 𝓁2-homological test for the planarity of a graph
AKCE International Journal of Graphs and Combinatorics, 2020 Given a finite simple graph Γ, one is able to define the presentation of an associate Coxeter group and construct a CW-complex on which the associated Coxeter group acts.
Elizabeth Donovan, Timothy Schroeder
doaj +1 more source
Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity [PDF]
, 2017 We introduce and study the problem Ordered Level Planarity which asks for a planar drawing of a graph such that vertices are placed at prescribed positions in the plane and such that every edge is realized as a y-monotone curve.
Günter Rote +3 more
core +1 more source
IEEE Microwave Magazine, 2006 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
Journal of Combinatorial Theory, Series A, 2018 The error in the differentiation argument has been ...
Simeon Ball, Michel Lavrauw
openaire +6 more sources
, 2013 In this paper we introduce and study the strip planarity testing problem, which takes as an input a planar graph G(V,E) and a function γ:V → {1,2,…,k} and asks whether a planar drawing of G exists such that each edge is monotone in the y-direction and ...
Angelini, Patrizio +7 more
core +1 more source
Heliyon, 2023 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
Constrained Planarity in Practice -- Engineering the Synchronized Planarity Algorithm [PDF]
, 2023 In the constrained planarity setting, we ask whether a graph admits a planar drawing that additionally satisfies a given set of constraints. These constraints are often derived from very natural problems; prominent examples are Level Planarity, where ...
Fink, Simon D., Rutter, Ignaz
core +1 more source
Theoretical Computer Science, 2018 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
Planar Earthmover is not in L_1 [PDF]
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), 2006 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,...,n\}^2\subseteq \R^2$ incurs distortion $Ω(\sqrt{\log n})$. 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 +2 more sources
Additional PC-Tree Planarity Conditions [PDF]
, 2004 Recent research efforts have produced new algorithms for solving planarity-related problems. One such method performs vertex addition using the PC-tree data structure, which is similar to but simpler than the well-known PQ-tree.
Boyer, John M., John M. Boyer
core +1 more source