Műegyetemi Digitális Archivum
    • magyar
    • English
  • English 
    • magyar
    • English
  • Login
View Item 
  •   DSpace Home
  • 1. Tudományos közlemények, publikációk
  • BME PA dokumentumai
  • View Item
  •   DSpace Home
  • 1. Tudományos közlemények, publikációk
  • BME PA dokumentumai
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

On Finding Maximally Redundant Trees in Strictly Linear Time

Thumbnail
View/Open
71685.pdf (237.0Kb)
Metadata
Show full item record
Link to refer to this document:
http://hdl.handle.net/10890/3503
Collections
  • BME PA dokumentumai [3590]
Title
On Finding Maximally Redundant Trees in Strictly Linear Time
Author
Enyedi, Gábor Sándor
Rétvári, Gábor
Császár, András
Date of issue
2009
Language
en
Identifiers
MTMT: 2644759
Scopus: 70449481434
Web of Science: 000277119300034
Title of the container document
IEEE Symposium on Computers and Communications (ISCC'09)
Document type
egyéb konferenciaközlemény
Document genre
konferenciaközlemény

Content by
Theme by 
Atmire NV
DSpace software copyright © 2002-2016  DuraSpace
Contact Us | Send Feedback

Content by
DSpace software copyright © 2002-2016  DuraSpace
Contact Us | Send Feedback
Theme by 
Atmire NV
 

 

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister

Content by
Theme by 
Atmire NV
DSpace software copyright © 2002-2016  DuraSpace
Contact Us | Send Feedback

Content by
DSpace software copyright © 2002-2016  DuraSpace
Contact Us | Send Feedback
Theme by 
Atmire NV