Pages that link to "Item:Q547303"

The following pages link to Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time (Q547303):

Displaying 5 items.

• Topological morphing of planar graphs (Q386891) (← links)
• An SPQR-tree-like embedding representation for upward planarity (Q2206883) (← links)
• Planar Embeddings with Small and Uniform Faces (Q2942666) (← links)
• Approximation Algorithms for Facial Cycles in Planar Embeddings (Q5091033) (← links)
• (Q6065397) (← links)