Sciweavers

653 search results - page 15 / 131
» The size of minimum 3-trees
Sort
View
CORR
2008
Springer
120views Education» more  CORR 2008»
14 years 9 months ago
Menger's Paths with Minimum Mergings
For an acyclic directed graph with multiple sources and multiple sinks, we prove that one can choose the Menger's paths between the sources and the sinks such that the number...
Guangyue Han
JGT
2008
88views more  JGT 2008»
14 years 9 months ago
On minimum sets of 1-factors covering a complete multipartite graph
We determine necessary and sufficient conditions for a complete multipartite graph to admit a set of 1-factors whose union is the whole graph and, when these conditions are satisf...
David Cariolaro, Hung-Lin Fu
CORR
2006
Springer
132views Education» more  CORR 2006»
14 years 9 months ago
Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element
The running maximum-minimum (MAX-MIN) filter computes the maxima and minima over running windows of size w. This filter has numerous applications in signal processing and time seri...
Daniel Lemire
DAC
2000
ACM
15 years 10 months ago
MINFLOTRANSIT: min-cost flow based transistor sizing tool
This paper presents MINFLOTRANSIT, a new transistor sizing tool for fast sizing of combinational circuits with minimal cost. MINFLOTRANSIT is an iterative relaxation based tool th...
Vijay Sundararajan, Sachin S. Sapatnekar, Keshab K...
LATIN
2010
Springer
15 years 4 months ago
The Size and Depth of Layered Boolean Circuits
We consider the relationship between size and depth for layered Boolean circuits, synchronous circuits and planar circuits as well as classes of circuits with small separators. In ...
Anna Gál, Jing-Tang Jang