Results 41 to 50 of about 22,383 (289)
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
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
In this paper we settle the computational complexity of two open problems related to the extension of the notion of level planarity to surfaces different from the plane. Namely, we show that the problems of testing the existence of a level embedding of a
Frati, F. +20 more
core +2 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
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
Line graph embedding of co-intersection graph of ideals of commutative rings
This research paper focuses on the co-intersection graph of a commutative ring [Formula: see text]. The co-intersection graph of [Formula: see text] denoted by [Formula: see text] is a simple graph with vertices that are non-trivial ideals of [Formula ...
Ali Al Khabyah +4 more
doaj +1 more source
Noise modeling and depth calibration for Time-Of-Flight cameras
thesis extended ...
Amira Belhedi
doaj +1 more source

