Sciweavers

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

21

IWOCA
2009
Springer

favoriteEmaildiscussreport

137views Algorithms» more IWOCA 2009»

Embedded Trees and the Support of the ISE

14 years 5 months ago

Embedded Trees and the Support of the ISE

Download www.dmg.tuwien.ac.at

Embedded trees are labelled rooted trees, where the root has zero label and where the labels of adjacent vertices diﬀer (at most) by

Michael Drmota

Real-time Traffic

Adjacent Vertices Diﬀer | Algorithms | IWOCA 2009 | Rooted Trees |

claim paper

Related Content

» ISEGEN Generation of HighQuality Instruction Set Extensions by Iterative Improvement

» On the Theory of Pfaffian Orientations II Tjoins kcuts and Duality of Enumeration

» Perfect trees and elementary embeddings

» LowDistortion Embeddings of Trees

» Embedding Similarity Joins into Native XML Databases

» Towards QuadtreeBased Moving Objects Databases

» A Design Flow for Architecture Exploration and Implementation of Partially Reconfigurable ...

» On memory protection in realtime OS for small embedded systems

» Lower bounds for graph embeddings and combinatorial preconditioners

Post Info
More Details (n/a)

Added	27 May 2010
Updated	27 May 2010
Type	Conference
Year	2009
Where	IWOCA
Authors	Michael Drmota

Comments (0)