Sciweavers

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

9

ESA
2009
Springer

favoriteEmaildiscussreport

98views Algorithms» more ESA 2009»

A Linear Time Algorithm for L(2, 1)-Labeling of Trees

13 years 9 months ago

A Linear Time Algorithm for L(2, 1)-Labeling of Trees

Download qir.kyushu-u.ac.jp

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yush

Real-time Traffic

ESA 2009 |

claim paper

Related Content

» Exact Algorithms for L 2 1Labeling of Graphs

» LinearTime Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs

» Finding a 2Core of a Tree in Linear Time

» A Linear Time Histogram Metric for Improved SIFT Matching

» Minimax Trees in Linear Time with Applications

» Exact Bipartite Crossing Minimization under Tree Constraints

» Partitioning Nominal Attributes in Decision Trees

» Optimal Integer Alphabetic Trees in Linear Time

» Beta Random Projection

Post Info
More Details (n/a)

Added	24 Jul 2010
Updated	24 Jul 2010
Type	Conference
Year	2009
Where	ESA
Authors	Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Comments (0)