Ara
Toplam kayıt 2, listelenen: 1-2
Crossing minimization in weighted bipartite graphs
(Springer, 2007)
Given a bipartite graph G = (L-0, L-1, E) and a fixed ordering of the nodes in L-0, the problem of finding an ordering of the nodes in L-1 that minimizes the number of crossings has received much attention in literature. ...
A Numerical real frequency broadband matching technique based on parametric representation of scattering parameters
(IEEE, 1998-11-24)
In this study, a computer, aided broadband matching technique based on the parametric representation of scattering parameters is proposed. The new technique combines the advantageous of the so called parametric approach ...