The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...
In this paper, we address the interconnect-driven floorplanning problem that integrates OPC-friendly bus assignment with floorplanning. Buses consist of a number of horizontal/v...
Hua Xiang, Liang Deng, Li-Da Huang, Martin D. F. W...
A significant problem for evolving artificial neural networks is that the physical arrangement of sensors and effectors is invisible to the evolutionary algorithm. For example,...
Transmission-scheduling protocols can support contention-free link-level broadcast transmissions and delay sensitive traffic in mobile, multiple-hop packet radio networks. Use of t...
Praveen K. Appani, Joseph L. Hammond, Daniel L. No...