z-logo
open-access-imgOpen Access
I/O-Efficient Algorithms on Near-Planar Graphs
Author(s) -
Herman Haverkort,
Laura Toma
Publication year - 2011
Publication title -
journal of graph algorithms and applications
Language(s) - Uncategorized
Resource type - Journals
SCImago Journal Rank - 0.387
H-Index - 38
ISSN - 1526-1719
DOI - 10.7155/jgaa.00236
Subject(s) - computer science , planar , planar graph , algorithm , planar straight line graph , combinatorics , mathematics , 1 planar graph , chordal graph , graph , theoretical computer science , computer graphics (images)

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here