Planar graphs as L-intersection or L-contact graphs.

Daniel Gonçalves Lucas Isenmann Claire Pennarun

Published in: CoRR (2017)

Keyphrases

planar graphs
max cut
undirected graph
minimum weight
higher order
linear programming
complex networks
bipartite graph
approximate inference