Connectivity in evolving graph with geometric properties

Aubin Jarry, Zvi Lotker

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

11 Scopus citations

Abstract

The evolving graph model was developed to capture the information on the topology of dynamic networks in a compact and efficient manner [5]. It is known that to find the size of the maximum strongly connected component in evolving graphs is NP-hard [1], In this paper we study the strongly connected component in evolving graphs with geometric properties. We show that SCC is still NP-hard in the case the nodes are placed on a grid and two points are connected if the Euclidean distance is equal or less than 2. On the other hand we show that if the underlying graph is tree this problem can be solved in polynomial time.

Original languageEnglish
Title of host publicationProceedings of the 2004 Joint Workshop on Foundations of Mobile Computing, DIALM-POMC'04
PublisherAssociation for Computing Machinery (ACM)
Pages24-30
Number of pages7
ISBN (Print)1581139217, 9781581139211
DOIs
StatePublished - 1 Jan 2004
Externally publishedYes
EventProceedings of the 2004 Joint Workshop on Foundations of Mobile Computing, DIALM-POMC'04 - Philadelphia, PA, United States
Duration: 1 Oct 20041 Oct 2004

Publication series

NameProceedings of the 2004 Joint Workshop on Foundations of Mobile Computing, DIALM-POMC'04

Conference

ConferenceProceedings of the 2004 Joint Workshop on Foundations of Mobile Computing, DIALM-POMC'04
Country/TerritoryUnited States
CityPhiladelphia, PA
Period1/10/041/10/04

Keywords

  • Connectivity
  • Disc Graphs
  • Dynamic networks
  • Evolving Graphs
  • Trees

Fingerprint

Dive into the research topics of 'Connectivity in evolving graph with geometric properties'. Together they form a unique fingerprint.

Cite this