Data graph formulation as the minimum-weight maximum-entropy problem

DOI10.1007/978-3-319-18224-7_2zbMATH Open1437.68138OpenAlexW2222368480MaRDI QIDQ3300142FDOQ3300142

Authors: 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

Recommendations

• Structural, Syntactic, and Statistical Pattern Recognition
• Matching Delaunay graphs
• Graph-Based Representations in Pattern Recognition
• Graph matching based on dot product representation of graphs
• Modeling graphs using dot product representations

zbMATH Keywords

combinatorial optimizationgraph realizationdata-graph

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: Data graph formulation as the minimum-weight maximum-entropy problem

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