Pages that link to "Item:Q1275085"
From MaRDI portal
The following pages link to The parallel complexity of approximating the high degree subgraph problem (Q1275085):
Displaying 4 items.
- Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\) (Q1351969) (← links)
- Parallel Complexity of the Connected Subgraph Problem (Q4202213) (← links)
- (Q4290645) (← links)
- The parallel complexity of approximating the High Degree Subgraph problem (Q6487954) (← links)