Pages that link to "Item:Q2166729"
From MaRDI portal
The following pages link to The balanced connected subgraph problem for geometric intersection graphs (Q2166729):
Displaying 4 items.
- Complexity and inapproximability results for balanced connected subgraph problem (Q2232593) (← links)
- The balanced connected subgraph problem (Q5918764) (← links)
- Space-efficient algorithms for reachability in directed geometric graphs (Q6039899) (← links)
- On the hardness of the Balanced Connected Subgraph Problem for families of Regular Graphs (Q6068941) (← links)