170 search results - page 9 / 34 » Cross-Composition: A New Technique for Kernelization Lower B... |
SPAA
1993
ACM
14 years 26 days ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
ISCC
2005
IEEE
14 years 2 months ago
2005
IEEE
The broad spread of packet data networks and the emergence of applications in multimedia communications, created a driving force towards an improved Quality of Service (QoS) model...
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
— We propose the novel concept of cooperation for deafness prevention in directional antenna ad hoc networks, along with a low-complexity multiuser detector specialised for these...
SPAA
1994
ACM
14 years 26 days ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
GBRPR
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...