Sciweavers

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

13

CORR
2008
Springer

favoriteEmaildiscussreport

78views Education» more CORR 2008»

A linear time algorithm for L(2,1)-labeling of trees

13 years 11 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

CORR 2008 | Education |

claim paper

Related Content

» A Linear Time Algorithm for L2 1Labeling of Trees

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

» Finding a 2Core of a Tree in Linear Time

» Minimax Trees in Linear Time with Applications

» Optimal Integer Alphabetic Trees in Linear Time

» A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane

» A Very Fast Linear Time Distributed Algorithm on General Graphs for the MinimumWeight Span...

» Finding an optimal tree searching strategy in linear time

» Finding a TwoCore of a Tree in Linear Time

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Comments (0)