On Finding Maximally Redundant Trees in Strictly Linear Time

Thumbnail
View/Open
Metadata
Show full item record
Link to refer to this document:
http://hdl.handle.net/10890/3503
Collections
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