Sparsifier subgraphs
Statement
Devise combinatorial polynomial-time algorithms for the following two problems. Given a graph G, find a subgraph H with edges such that for every Given a graph G, find a subgraph H with edges such that for every
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.