Skip to main content
Műegyetemi Digitális Archívum
English
العربية
বাংলা
Català
Čeština
Deutsch
Ελληνικά
Español
Suomi
Français
Gàidhlig
हिंदी
Magyar
Italiano
Қазақ
Latviešu
Nederlands
Polski
Português
Português do Brasil
Srpski (lat)
Српски
Svenska
Türkçe
Yкраї́нська
Tiếng Việt
Log In
Log in
New user? Click here to register.
Have you forgotten your password?
Log in with Shibboleth
Communities & Collections
All of DSpace
Statistics
BME OMIKK
Home
1. Tudományos közlemények, publikációk
BME PA dokumentumai
On Finding Maximally Redundant Trees in Strictly Linear Time
On Finding Maximally Redundant Trees in Strictly Linear Time
Files
Primary
71685.pdf
(237.04 KB)
Date
2009
Title
On Finding Maximally Redundant Trees in Strictly Linear Time
Authors
Enyedi, Gábor Sándor
Rétvári, Gábor
Császár, András
Type
egyéb konferenciaközlemény
Container Title
IEEE Symposium on Computers and Communications (ISCC'09)
Gender
konferenciaközlemény
Cite this item
http://hdl.handle.net/10890/3503
OOC works
Abstract
Description
Keywords
Collections
BME PA dokumentumai
Full item page