Grounded String Representations of Series-Parallel Graphs without Transitive Edges — Quantapedia

In a {\em grounded string representation} of a graph there is a horizontal line $\ell$ and each vertex is represented as a simple curve below $\ell$ with one end point on $\ell$ such that two curves i

Powered by Quantum Pulse Intelligence