Realizability of graph specifications: Characterizations and algorithms

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

doi:10.1007/978-3-030-01325-7_1

Realizability of graph specifications: Characterizations and algorithms

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

15 Scopus citations

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 ₁ , …, 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 ₁ , …, 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 language	English
Title of host publication	25th International Colloquium, SIROCCO 2018, Revised Selected Papers
Editors	Zvi Lotker, Boaz Patt-Shamir
Publisher	Springer Verlag
Pages	3-13
Number of pages	11
ISBN (Print)	9783030013240
DOIs	https://doi.org/10.1007/978-3-030-01325-7_1
State	Published - 2018
Event	25th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2018 - Ma’ale HaHamisha, Israel Duration: 18 Jun 2018 → 21 Jun 2018

Publication series

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

Conference

Conference	25th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2018
Country/Territory	Israel
City	Ma’ale HaHamisha
Period	18/06/18 → 21/06/18

Bibliographical note

Publisher Copyright:
© Springer Nature Switzerland AG 2018.

Funding

A. Bar-Noy—Research was sponsored by the Army Research Laboratory and was accomplished under Cooperative Agreement Number W911NF-09-2-0053 (the ARL Network Science CTA).

Funders	Funder number
ARL Network Science CTA
Army Research Laboratory	W911NF-09-2-0053

Access to Document

10.1007/978-3-030-01325-7_1

Cite this

Bar-Noy, A., Choudhary, K., Peleg, D., & Rawitz, D. (2018). Realizability of graph specifications: Characterizations and algorithms. In Z. Lotker, & B. Patt-Shamir (Eds.), 25th International Colloquium, SIROCCO 2018, Revised Selected Papers (pp. 3-13). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11085). Springer Verlag. https://doi.org/10.1007/978-3-030-01325-7_1

Bar-Noy, Amotz ; Choudhary, Keerti ; Peleg, David et al. / Realizability of graph specifications : Characterizations and algorithms. 25th International Colloquium, SIROCCO 2018, Revised Selected Papers. editor / Zvi Lotker ; Boaz Patt-Shamir. Springer Verlag, 2018. pp. 3-13 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{888a0f8c228246dea8cea9aa0e12a63c,

title = "Realizability of graph specifications: Characterizations and algorithms",

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.",

author = "Amotz Bar-Noy and Keerti Choudhary and David Peleg and Dror Rawitz",

note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2018.; 25th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2018 ; Conference date: 18-06-2018 Through 21-06-2018",

year = "2018",

doi = "10.1007/978-3-030-01325-7_1",

language = "אנגלית",

isbn = "9783030013240",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "3--13",

editor = "Zvi Lotker and Boaz Patt-Shamir",

booktitle = "25th International Colloquium, SIROCCO 2018, Revised Selected Papers",

address = "גרמניה",

}

Bar-Noy, A, Choudhary, K, Peleg, D & Rawitz, D 2018, Realizability of graph specifications: Characterizations and algorithms. in Z Lotker & B Patt-Shamir (eds), 25th International Colloquium, SIROCCO 2018, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11085, Springer Verlag, pp. 3-13, 25th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2018, Ma’ale HaHamisha, Israel, 18/06/18. https://doi.org/10.1007/978-3-030-01325-7_1

Realizability of graph specifications: Characterizations and algorithms. / Bar-Noy, Amotz; Choudhary, Keerti; Peleg, David et al.
25th International Colloquium, SIROCCO 2018, Revised Selected Papers. ed. / Zvi Lotker; Boaz Patt-Shamir. Springer Verlag, 2018. p. 3-13 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11085).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Realizability of graph specifications

T2 - 25th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2018

AU - Bar-Noy, Amotz

AU - Choudhary, Keerti

AU - Peleg, David

AU - Rawitz, Dror

PY - 2018

Y1 - 2018

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85061162580&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-01325-7_1

DO - 10.1007/978-3-030-01325-7_1

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85061162580

SN - 9783030013240

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 3

EP - 13

BT - 25th International Colloquium, SIROCCO 2018, Revised Selected Papers

A2 - Lotker, Zvi

A2 - Patt-Shamir, Boaz

PB - Springer Verlag

Y2 - 18 June 2018 through 21 June 2018

ER -

Bar-Noy A, Choudhary K, Peleg D, Rawitz D. Realizability of graph specifications: Characterizations and algorithms. In Lotker Z, Patt-Shamir B, editors, 25th International Colloquium, SIROCCO 2018, Revised Selected Papers. Springer Verlag. 2018. p. 3-13. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-01325-7_1

Realizability of graph specifications: Characterizations and algorithms

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this