Realizability of graph specifications: characterizations and algorithms

DOI10.1007/978-3-030-01325-7_1OpenAlexW2899106323MaRDI QIDQ1713877FDOQ1713877

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

Recommendations

• Composed degree-distance realizations of graphs
• Graph realizations: maximum degree in vertex neighborhoods
• Vertex-weighted realizations of graphs
• Realizability and uniqueness in graphs
• Graph profile realizations and applications to social networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx)

Cited In (12)

• Sufficient conditions for the marked graph realisability of labelled transition systems
• Graph realizations: maximum degree in vertex neighborhoods
• Title not available (Why is that?)
• Efficiently Realizing Interval Sequences
• Realization problems on reachability sequences
• Vertex-weighted graphs: realizable and unrealizable domains
• Vertex-weighted realizations of graphs
• On vertex-weighted graph realizations
• Composed degree-distance realizations of graphs
• Composed degree-distance realizations of graphs
• Title not available (Why is that?)
• Realizability and verification of MSC graphs

This page was built for publication: Realizability of graph specifications: characterizations and algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1713877)