389 citations · 1.1k across the 26 of their papers we have counts for
4 papers · 1 filter
Approximating the Graph Edit Distance with Compact Neighborhood Representations
Franka Bause, Christian Permann, Nils M. Kriege
The graph edit distance is used for comparing graphs in various domains. Due to its high computational complexity it is primarily approximated. Widely-used heuristics search for an…
On the Two Sides of Redundancy in Graph Neural Networks
Franka Bause, Samir Moustafa, Johannes Langguth +2
Message passing neural networks iteratively generate node embeddings by aggregating information from neighboring nodes. With increasing depth, information from more distant nodes i…
A Higher-Order Temporal H-Index for Evolving Networks
Lutz Oettershagen, Nils M. Kriege, Petra Mutzel
The H-index of a node in a static network is the maximum value such that at least of its neighbors have a degree of at least . Recently, a generalized version, the -t…
Improved Exact and Heuristic Algorithms for Maximum Weight Clique
Roman Erhardt, Kathrin Hanauer, Nils Kriege +2
We propose improved exact and heuristic algorithms for solving the maximum weight clique problem, a well-known problem in graph theory with many applications. Our algorithms interl…