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
N1 - Publisher Copyright: © Springer Nature Switzerland AG 2018.
PY - 2018/10/31
Y1 - 2018/10/31
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 - https://doi.org/10.1007/978-3-030-01325-7_1
DO - https://doi.org/10.1007/978-3-030-01325-7_1
M3 - منشور من مؤتمر
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 - Structural Information and Communication Complexity
A2 - Lotker, Zvi
A2 - Patt-Shamir, Boaz
PB - Springer Verlag
Y2 - 18 June 2018 through 21 June 2018
ER -