The Complexity of Homomorphism Reconstructibility

Representing graphs by their homomorphism counts has led to the beautiful theory of homomorphism indistinguishability in recent years. Moreover, homomorphism counts have promising applications in database theory and machine learning, where one would like to answer queries or classify graphs solely b...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Böker, Jan, Härtel, Louis, Runde, Nina, Seppelt, Tim, Standke, Christoph
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Data Structures and Algorithms Computer Science - Discrete Mathematics Mathematics - Combinatorics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!