Realizability of graph specifications: characterizations and algorithms
From MaRDI portal
Publication:1713877
DOI10.1007/978-3-030-01325-7_1OpenAlexW2899106323MaRDI QIDQ1713877
David Peleg, Keerti Choudhary, Dror Rawitz, Amotz Bar-Noy
Publication date: 30 January 2019
Full work available at URL: https://doi.org/10.1007/978-3-030-01325-7_1
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx)
Related Items (9)
Vertex-weighted graphs: realizable and unrealizable domains ⋮ Graph realizations: maximum degree in vertex neighborhoods ⋮ Unnamed Item ⋮ On vertex-weighted graph realizations ⋮ Efficiently Realizing Interval Sequences ⋮ Vertex-weighted realizations of graphs ⋮ Composed degree-distance realizations of graphs ⋮ Realization problems on reachability sequences ⋮ Composed degree-distance realizations of graphs
This page was built for publication: Realizability of graph specifications: characterizations and algorithms
