Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
22
click to vote
IWOCA
2009
Springer
favorite
Email
discuss
report
137
views
Algorithms
»
more
IWOCA 2009
»
Embedded Trees and the Support of the ISE
14 years 6 months ago
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 differ (at most) by
Michael Drmota
Real-time Traffic
Adjacent Vertices Differ
|
Algorithms
|
IWOCA 2009
|
Rooted Trees
|
claim paper
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)
Researcher Info
Algorithms Study Group
Computer Vision