197 search results - page 15 / 40 » New Upper Bounds for Ramsey Numbers |
WAOA
2007
Springer
14 years 2 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
MST
2002
13 years 7 months ago
2002
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
ANTS
1994
Springer
14 years 11 hour ago
1994
Springer
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...
TWC
2010
13 years 2 months ago
2010
Abstract--We develop a new metric for quantifying end-toend throughput in multihop wireless networks, which we term random access transport capacity, since the interference model p...
LCTRTS
2010
Springer
13 years 10 months ago
2010
Springer
In preemptive real-time systems, scheduling analyses need—in addition to the worst-case execution time—the context-switch cost. In case of preemption, the preempted and the pr...