Results 21 to 30 of about 371,700 (244)
Efficient enhancements in spectral domain method to speed up open planar circuit analysis [PDF]
, 1998 The spectral domain method is a very fast and powerful technique to analyse planar microwave circuits. Available techniques for simulating the excitation of open planar microwave circuits are not very effective at relatively low frequencies.
Railton, CJ +3 more
core +1 more source
The Liouville and the intersection properties are equivalent for planar graphs [PDF]
, 2012 It is shown that if a planar graph admits no non-constant bounded harmonic function then the trajectories of two independent simple random walks intersect almost ...
Itai Benjamini +5 more
core +1 more source
Clustered Planarity = Flat Clustered Planarity [PDF]
, 2018 The complexity of deciding whether a clustered graph admits a clustered planar drawing is a long-standing open problem in the graph drawing research area. Several research efforts focus on a restricted version of this problem where the hierarchy of the clusters is "flat", i.e., no cluster different from the root contains other clusters.
Pier Francesco Cortese +1 more
openaire +3 more sources
Journal of Algebraic Combinatorics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Starr, Colin L., Turner, Galen E. III
openaire +2 more sources
Recognizing IC-Planar and NIC-Planar Graphs
Journal of Graph Algorithms and Applications, 2018 We prove that triangulated IC-planar graphs and triangulated $K_5$-free or $X4W$-free NIC-planar graphs can be recognized in cubic time. A graph is 1-planar if it can be drawn in the plane with at most one crossing per edge. A drawing is IC-planar if, in addition, each vertex is incident to at most one crossing edge and NIC-planar if two pairs of ...
Christian Bachmaier +4 more
openaire +7 more sources
Journal of Graph Algorithms and Applications, 2018 In this paper, we introduce and study multilevel planarity, a generalization of upward planarity and level planarity. Let $G = (V, E)$ be a directed graph and let $\ell: V \to \mathcal P(\mathbb Z)$ be a function that assigns a finite set of integers to each vertex.
Lukas Barth +3 more
openaire +8 more sources
Optimal Design of Planar Paraller Manipulators 3 RRR Through Lower Energy Consumption
, 2009 Organised by: Cranfield UniversityIn most existing studies, the solutions of planar parallel manipulators are restricted to a feasible region of solution. This research provides an optimal solution in link dimension of planar parallel manipulators to a
Ledezma-Rubio, Y. A. +1 more
core +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,\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
Minimizing the oriented diameter of a planar graph [PDF]
, 2009 We consider the problem of minimizing the diameter of an orientation of a planar graph. A result of Chvátal and Thomassen shows that for general graphs, it is NP-complete to decide whether a graph can be oriented so that its diameter is at most two.
Noble, SD +3 more
core +1 more source
3D planar velocity measurements, using Mach-Zehnder interferometric-filter-based planar Doppler velocimetry (MZI-PDV) and imaging fibre bundles [PDF]
, 2008 Three component planar flow-field measurements are made using imaging fibre bundles to port different views of the measurement plane, defined by a laser light sheet, to a single imaging head.
Charrett, Thomas O. H. +7 more
core +1 more source