Sciweavers

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

25

HICSS
1997
IEEE

favoriteEmaildiscussreport

135views Biometrics» more HICSS 1997»

Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs

14 years 3 months ago

Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs

Download www-direction.inria.fr

Christian Laforest, Arthur L. Liestman, Thomas C.

Real-time Traffic

Biometrics | HICSS 1997 |

claim paper

Related Content

» A counterexample to the AlonSaksSeymour conjecture and related problems

» Covering TwoEdgeColoured Complete Graphs with Two Disjoint Monochromatic Cycles

» Geometric spanners with applications in wireless networks

» Spanners Weak Spanners and Power Spanners for Wireless Networks

» Perfect packings with complete graphs minus an edge

» Routing Numbers of Cycles Complete Bipartite Graphs and Hypercubes

» Induced Complete hpartite Graphs in Dense Cliqueless Graphs

» Spanners for Geometric Intersection Graphs

» AverageCase Analyses of Vickrey Costs

Post Info
More Details (n/a)

Added	06 Aug 2010
Updated	06 Aug 2010
Type	Conference
Year	1997
Where	HICSS
Authors	Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau

Comments (0)