Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

4

ARSCOM
1999

favoriteEmaildiscussreport

44views more ARSCOM 1999»

Bounds on the Total Redundance and Efficiency of a Graph

13 years 4 months ago

Bounds on the Total Redundance and Efficiency of a Graph

Download www.cs.clemson.edu

Wayne Goddard, Ortrud Oellermann, Peter J. Slater,

Real-time Traffic

ARSCOM 1999 |

claim paper

Related Content

» Delay efficient scheduling via redundant constraints in multihop networks

» Optimal and Efficient SpeculationBased Partial Redundancy Elimination

» Blocking for External Graph Searching

» Efficient Construction of a Bounded Degree Spanner with Low Weight

» Power Efficient Throughput Maximization in MultiHop Wireless Networks

» Efficient Discovery of Frequent Correlated Subgraph Pairs

» On MBR Approximation of Histories for Historical Queries Expectations and Limitations

» Twodimensional interleaving schemes with repetitions Constructions and bounds

» A Fresh Look at Optimizing Array Bound Checking

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1999
Where	ARSCOM
Authors	Wayne Goddard, Ortrud Oellermann, Peter J. Slater, Henda C. Swart

Comments (0)