A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. 1-planarity is known NP-hard, even for graphs of bounded bandwidth, pathwidth, or treewidth, and forâ€¦ (More)

Optical graph recognition (OGR) reverses graph drawing. A drawing transforms the topological structure of a graph into a graphical representation. Primarily, it maps vertices to points and displaysâ€¦ (More)

A graph is NIC-planar if it admits a drawing in the plane with at most one crossing per edge and such that two pairs of crossing edges share at most one common end vertex. NIC-planarity generalizesâ€¦ (More)

A graph is outer 1-planar (o1p) if it can be drawn in the plane such that all vertices are in the outer face and each edge is crossed at most once. o1p graphs generalize outerplanar graphs, which canâ€¦ (More)

A graph is outer 1-planar (o1p) if it can be drawn in the plane such that all vertices are on the outer face and each edge is crossed at most once. o1p graphs generalize outerplanar graphs, which canâ€¦ (More)

Graph drawing is the process of transforming the topological structure of a graph into a graphical representation. Primarily, it maps vertices to points and displays them by icons, and it maps edgesâ€¦ (More)