Pages that link to "Item:Q582090"

The following pages link to Ordered vertex removal and subgraph problems (Q582090):

Displaying 5 items.

• The parallel complexity of approximating the high degree subgraph problem (Q1275085) (← links)
• Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\) (Q1351969) (← links)
• On parallelizing a greedy heuristic for finding small dominant sets (Q2366651) (← links)
• The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem (Q4009810) (← links)
• The parallel complexity of approximating the High Degree Subgraph problem (Q6487954) (← links)