权威例句
Approximation algorithms for NP-complete problems on planar graphs
Approximation algorithms for NP-complete problems on planar graphs
An O (n log n) algorithm for maximum st -flow in a directed planar graph
Approximation algorithms for NP-complete problems on planar graphs
Approximation algorithm for NP-complete problems on planar graphs
How to draw a planar graph on a grid
The monadic second-order logic of graphs XII: planar graphs and planar maps
Every Planar Graph Is 5-Choosable
Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
Spectral partitioning works: planar graphs and finite element meshes
