The following pages link to Algorithmic graph embeddings (Q1391310):
Displaying 4 items.
- A note on approximating graph genus (Q290221) (← links)
- Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866) (← links)
- EXTENDING THE <i>DOUBLY LINKED FACE LIST</i> FOR THE REPRESENTATION OF 2-PSEUDOMANIFOLDS AND 2-MANIFOLDS WITH BOUNDARIES (Q2893465) (← links)
- Nearly time-optimal kernelization algorithms for the line-cover problem with big data (Q6586656) (← links)
