We are excited to announce a social activity at NetSci 2025: a graph matching game!
The game is meant to be a fun and engaging way to encourage networking and collaboration among attendees. Each participant will have a small graph on their badge. Each poster board will have a small graph pinned next to it. The goal of the game is to find matches with the poster boards and other participants.
Every day of the conference you can vote for up to 3 posters (using their graph ID as key), using this VOTE form. At the end of the last poster session, a committee will evaluate the most voted posters to assign the Best Poster Award.
In a nutshell, two graphs are isomorphic if they share the same topological structure. This means they have the same number of nodes and edges, and the connections between nodes are identical — only the node labels differ. In other words, you can rename the nodes of one graph to make it exactly match the other.
For example, the following graphs A and B are isomorphic:
A B | | C -- D
1 -- 2 | | 3 4
\( A \rightarrow 3 \)
\( B \rightarrow 4 \)
\( C \rightarrow 1 \)
\( D \rightarrow 2 \)
Another example with asymmetric graphs
A -- B | C -- D | | E F
1 -- 2 | 3 -- 4 | | 5 6
\( A \rightarrow 2 \)
\( B \rightarrow 1 \)
\( C \rightarrow 4 \)
\( D \rightarrow 3 \)
\( E \rightarrow 6 \)
\( F \rightarrow 5 \)
Oh, you reached the end of the post? You really wish for a prize, don’t you?
Well, the glory of winning is the best prize of all!
What? You want something more tangible? Alright, we will have some prizes for the winners.
Stay tuned for more details!