We prove that the rank-width of the incidence graph of a graph G is either equal to or exactly one less than the branch-width of G, unless the maximum degree of G is
Curves on surfaces play an important role in computer-aided geometric design. Because of the considerably high degree of exact curves on surfaces, approximation algorithms are pre...
Yi-Jun Yang, Song Cao, Jun-Hai Yong, Hui Zhang, Je...
Motivated by a class of orbit problems in astrophysics, this paper considers solutions to Hill's equation with forcing strength parameters that vary from cycle to cycle. The ...
A new exact explicit expression is derived for the ergodic capacity of maximal ratio combining (MRC) schemes over arbitrarily correlated Rician fading channels. This is used to stu...