Pages that link to "Item:Q6101019"

The following pages link to Pseudorandom sets in Grassmann graph have near-perfect expansion (Q6101019):

Displayed 7 items.

• Approximating power node-deletion problems (Q6057334) ‎ (← links)
• Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry (Q6066757) ‎ (← links)
• Incomplete list setting of the hospitals/residents problem with maximally satisfying lower quotas (Q6109545) ‎ (← links)
• Computing connected-\(k\)-subgraph cover with connectivity requirement (Q6111948) ‎ (← links)
• On the partial vertex cover problem in bipartite graphs -- a parameterized perspective (Q6151150) ‎ (← links)
• Safe sets and in-dominating sets in digraphs (Q6153473) ‎ (← links)
• Hypercontractivity on the symmetric group (Q6178439) ‎ (← links)