New bounds on the maximum number of edges in k-quasi-planar graphs.

Andrew Suk Bartosz Walczak

Published in: Comput. Geom. (2015)

Keyphrases

maximum number
planar graphs
undirected graph
upper bound
weighted graph
spanning tree
upper and lower bounds
minimum weight
edge information
lower bound
directed graph
edge detector
edge map
minimum spanning tree
partition function
directed acyclic graph
markov random field
worst case
lower and upper bounds