Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...
Christian Bachmaier, Franz-Josef Brandenburg, Wolf...
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
— Cross-layer optimization (CLO) promises significant gains in comparison to a conventional system design, which does not allow for information exchange across layers. One of th...
Andreas Saul, Shoaib Khan, Gunther Auer, Wolfgang ...
Linear interpolation is the standard image blending method used in image compositing. By averaging in the dynamic range, it reduces contrast and visibly degrades the quality of co...
Mark Grundland, Rahul Vohra, Gareth P. Williams, N...
In this note we address the question whether for a given prime number p, the zeta-function of a number field always determines the p-part of its class number. The answer is known t...