Realizability of graph specifications: Characterizations and algorithms

Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz

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

Abstract

The study of graphs and networks often involves studying various parameters of the graph vertices, capturing different aspects of the graph structure, such as the vertex degrees or the distances between the vertices. Given an n-vertex graph G and a parameter of interest f, one may associate with G a vector F(G) = 〈f 1 , …, f n 〉 giving the value of f for each vertex. This vector can be thought of as the f-profile of the graph. This paper concerns the dual problem, where given an n-entry f-specification vector F = 〈f 1 , …, f n 〉, we need to decide whether it is possible to find a graph G realizing this specification, namely, whose f-profile F(G) conforms to F. The paper introduces the notion of graph realiziations and illustrates a number of example problems related to finding graph realiziations for given specifications.

Original languageEnglish
Title of host publicationStructural Information and Communication Complexity
Subtitle of host publication25th International Colloquium, SIROCCO 2018, Revised Selected Papers
EditorsZvi Lotker, Boaz Patt-Shamir
PublisherSpringer Verlag
Pages3-13
Number of pages11
ISBN (Print)9783030013240
DOIs
StatePublished - 31 Oct 2018
Event25th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2018 - Ma’ale HaHamisha, Israel
Duration: 18 Jun 201821 Jun 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11085

Conference

Conference25th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2018
Country/TerritoryIsrael
CityMa’ale HaHamisha
Period18/06/1821/06/18

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Realizability of graph specifications: Characterizations and algorithms'. Together they form a unique fingerprint.

Cite this