197 search results - page 15 / 40 » New Upper Bounds for Ramsey Numbers |
118
click to vote
WAOA
2007
Springer
15 years 8 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...
105
click to vote
MST
2002
15 years 1 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...
108
click to vote
ANTS
1994
Springer
15 years 6 months 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...
136
click to vote
TWC
2010
14 years 8 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...
154
click to vote
LCTRTS
2010
Springer
15 years 3 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...