Pages that link to "Item:Q876504"
From MaRDI portal
The following pages link to Configurations with few crossings in topological graphs (Q876504):
Displaying 4 items.
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs (Q904086) (← links)
- Maximum weighted matching with few edge crossings for 2-layered bipartite graph (Q2004074) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Non-crossing geometric steiner arborescences (Q5136274) (← links)
