Localized network representations

David Peleg

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The talk will concern compact, localized and distributed network representation methods. Traditional approaches to network representation are based on global data structures, which require access to the entire structure even if the sought information involves only a small and local set of entities. In contrast, localized network representation schemes are based on breaking the information into small local pieces, or labels, selected in a way that allows one to infer information regarding a small set of entities directly from their labels, without using any additional (global) information. The talk will concentrate mainly on combinatorial and algorithmic techniques, such as adjacency and distance labeling schemes and interval schemes for routing, and will cover a variety of complexity results.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsRossella Petreschi, Riccardo Silvestri , Giuseppe Persiano
PublisherSpringer Verlag
Pages1
Number of pages1
ISBN (Print)3540401768, 9783540401766
DOIs
StatePublished - 2003
Externally publishedYes
Event5th Italian Conference on Algorithms and Complexity, CIAC 2003 - Rome, Italy
Duration: 28 May 200330 May 2003

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2653
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th Italian Conference on Algorithms and Complexity, CIAC 2003
Country/TerritoryItaly
CityRome
Period28/05/0330/05/03

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2003.

Fingerprint

Dive into the research topics of 'Localized network representations'. Together they form a unique fingerprint.

Cite this