Data Graph Formulation as the Minimum-Weight Maximum-Entropy Problem

DOI10.1007/978-3-319-18224-7_2zbMath1437.68138OpenAlexW2222368480MaRDI QIDQ3300142

Samuel de Sousa, Walter G. Kropatsch

Publication date: 27 July 2020

Published in: Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18224-7_2

zbMATH Keywords

combinatorial optimizationgraph realizationdata-graph

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Cites Work

• Matching graphs with unique node labels
• Graph-based point drift: graph centrality on the registration of point-sets
• A remark on the existence of finite graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I

This page was built for publication: Data Graph Formulation as the Minimum-Weight Maximum-Entropy Problem