The following pages link to Algorithmic graph embeddings (Q1391310):
Displaying 10 items.
- A note on approximating graph genus (Q290221) (← links)
- Errors in graph embedding algorithms (Q632808) (← links)
- On algorithmic applications of the immersion order: An overview of ongoing work presented at the Third Slovenian International Conference on Graph Theory (Q1379838) (← links)
- An efficient algorithm for embedding nonplanar graphs in planes (Q1868502) (← links)
- Natural alpha embeddings (Q2046664) (← links)
- Testing graph isotopy on surfaces (Q2441582) (← links)
- Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866) (← links)
- Extending the doubly linked face list for the representation of 2-pseudomanifolds and 2-manifolds with boundaries (Q2893465) (← links)
- On the complexity of graph embeddings (Q5060116) (← links)
- Nearly time-optimal kernelization algorithms for the line-cover problem with big data (Q6586656) (← links)
