Pages that link to "Item:Q1044035"
From MaRDI portal
The following pages link to Planar bichromatic minimum spanning trees (Q1044035):
Displaying 11 items.
- On the red/blue spanning tree problem (Q534557) (← links)
- Vertex-colored encompassing graphs (Q742604) (← links)
- Planar bichromatic minimum spanning trees (Q1044035) (← links)
- Plane bichromatic trees of low degree (Q1650794) (← links)
- Colored spanning graphs for set visualization (Q1699297) (← links)
- Geometric planar networks on bichromatic collinear points (Q2664940) (← links)
- Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem (Q2985117) (← links)
- Planar Bichromatic Bottleneck Spanning Trees (Q5874461) (← links)
- Maximum plane trees in multipartite geometric graphs (Q5915987) (← links)
- The balanced connected subgraph problem (Q5918764) (← links)
- Approximation algorithms for solving the 1-line minimum Steiner tree of line segments problem (Q6601971) (← links)