New Bounds on the Maximum Number of Edges in k-Quasi-Planar Graphs.
Andrew SukBartosz WalczakPublished in: Graph Drawing (2013)
Keyphrases
- maximum number
- planar graphs
- undirected graph
- weighted graph
- upper bound
- minimum weight
- directed graph
- approximate inference
- worst case
- graph structure
- lower bound
- upper and lower bounds
- spanning tree
- edge information
- directed acyclic graph
- lower and upper bounds
- least squares
- probabilistic model
- training set
- objective function
- model selection