Sciweavers

3211 search results - page 501 / 643
» On the Grundy Number of a Graph
Sort
View
GLVLSI
2007
IEEE
187views VLSI» more  GLVLSI 2007»
14 years 3 months ago
DAG based library-free technology mapping
This paper proposes a library-free technology mapping algorithm to reduce delay in combinational circuits. The algorithm reduces the overall number of series transistors through t...
Felipe S. Marques, Leomar S. da Rosa Jr., Renato P...
ICC
2007
IEEE
139views Communications» more  ICC 2007»
14 years 3 months ago
Distributed Link Scheduling for TDMA Mesh Networks
— We present a distributed scheduling algorithm for provisioning of guaranteed link bandwidths in ad hoc mesh networks. The guaranteed link bandwidths are necessary to provide de...
Petar Djukic, Shahrokh Valaee
COCO
2007
Springer
96views Algorithms» more  COCO 2007»
14 years 3 months ago
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of ...
Venkatesan Guruswami, Christopher Umans, Salil P. ...
EUROPAR
2007
Springer
14 years 3 months ago
On the Connectivity of Bluetooth-Based Ad Hoc Networks
We study the connectivity properties of a family of random graphs which closely model the Bluetooth’s device discovery process, where each device tries to connect to other device...
Pilu Crescenzi, Carlo Nocentini, Andrea Pietracapr...
FSTTCS
2007
Springer
14 years 3 months ago
Better Algorithms and Bounds for Directed Maximum Leaf Problems
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 ...