Sciweavers

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

73

Voted

JAL
2002

favoriteEmaildiscussreport

59views more JAL 2002»

On Graph Powers for Leaf-Labeled Trees

15 years 2 days ago

On Graph Powers for Leaf-Labeled Trees

Download users.uoa.gr

Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thi

Real-time Traffic

JAL 2002 |

claim paper

Related Content

» TreeDyn towards dynamic graphics and annotations for analyses of trees

» The power of two minhashes for similarity search among hierarchical data objects

» Facial Circuits of Planar Graphs and ContextFree Languages

» Bounded Degree Closest kTree Power Is NPComplete

» The Degree Distribution of Random kTrees

» Simplicial Powers of Graphs

» Structure and lineartime recognition of 4leaf powers

» Improving the Representation of Infinite Trees to Deal with Sets of Trees

» Extending the Tractability Border for Closest Leaf Powers

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	2002
Where	JAL
Authors	Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos

Comments (0)