
An O(n log n) algorithm for the maximal planar subgraph problem
de Jiazhen Cai
Ediciones (1)
- An O(n log n) algorithm for the maximal planar subgraph problem (1992)
Courant Institute of Mathematical Sciences, New York University · inglés

de Jiazhen Cai
Courant Institute of Mathematical Sciences, New York University · inglés