Pages that link to "Item:Q1920126"
From MaRDI portal
The following pages link to Complexity of the network median problem on planar grids (Q1920126):
Displaying 4 items.
- Are there any good digraph width measures? (Q896003) (← links)
- An efficient algorithm for solving the median problem on real road networks (Q5059369) (← links)
- Relevant Network Distances for Approximate Approach to Large p-Median Problems (Q5171787) (← links)
- Deciding whether a grid is a topological subgraph of a planar graph is NP-complete (Q5896079) (← links)