Computing k-hop Broadcast Trees Exactly

Machablishvili, Levan

Local TagsRelease HistoryDetailsSummary

Computing k-hop Broadcast Trees Exactly

Machablishvili, L. (2007). Computing k-hop Broadcast Trees Exactly. Master Thesis, Universität des Saarlandes, Saarbrücken.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0027-D10E-0 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0027-D10F-E

Genre: Thesis

Files

show Files

hide Files

:

Masterarbeit-Levan Machab-2007.pdf (Any fulltext), 2MB

File Permalink:
-

Name:
Masterarbeit-Levan Machab-2007.pdf

Description:
-

OA-Status:

Visibility:
Restricted (Max Planck Institute for Informatics, MSIN; )

MIME-Type / Checksum:
application/pdf

Technical Metadata:

Copyright Date:
-

Copyright Info:
-

License:
-

Locators

show

Creators

show

hide

Creators:
Machablishvili, Levan¹, Author
Funke, Stefan², Advisor
Hermanns, Holger³, Referee

Affiliations:
1International Max Planck Research School, MPI for Informatics, Max Planck Society, ou_1116551
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019
3External Organizations, ou_persistent22

Content

show

Details

show

hide

Language(s): eng - English

Dates: Accepted: 2007-09-28Date issued: 2007

Publication Status: Issued

Pages: -

Publishing info: Saarbrücken : Universität des Saarlandes

Table of Contents: -

Rev. Type: -

Identifiers: BibTex Citekey: Machablishvili2007

Degree: Master

Event

show

Legal Case

show

Project information

show

Source

show