Modelling Conflicts with Graphs

Say you have a problem where a bunch of algorithms recognise features in parallel

Each rectangle is a "claimed area"

Say you have a problem where a bunch of algorithms recognise features in parallel

Represent each rectangle with a vertex

Say you have a problem where a bunch of algorithms recognise features in parallel

Draw an edge between every two conflicting vertices

Say you have a problem where a bunch of algorithms recognise features in parallel

MAXIMAL INDEPENDENT SET

Say you have a problem where a bunch of algorithms recognise features in parallel

MAXIMAL INDEPENDENT SET

Say you have a problem where a bunch of algorithms recognise features in parallel

MAXIMAL INDEPENDENT SET

Modeling conflicts with graphs

By Gašper Ažman

Modeling conflicts with graphs

  • 184
Loading comments...

More from Gašper Ažman