Sciweavers

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

39

JCT
2008

favoriteEmaildiscussreport

55views more JCT 2008»

Packing of graphs with small product of sizes

13 years 10 months ago

Packing of graphs with small product of sizes

Download sitemason.vanderbilt.edu

Alexandr V. Kostochka, Gexin Yu

Real-time Traffic

JCT 2008 |

claim paper

Related Content

» Faster FixedParameter Tractable Algorithms for Matching and Packing Problems

» A Combinatorial Construction of AlmostRamanujan Graphs Using the ZigZag Product

» Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields

» The distinguishing number of Cartesian products of complete graphs

» Directed Random Dot Product Graphs

» Networks communities and kronecker products

» Interstitial Computing Utilizing Spare Cycles on Supercomputers

» On the approximability of influence in social networks

» SpaceTime Video Montage

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	JCT
Authors	Alexandr V. Kostochka, Gexin Yu

Comments (0)