Pages that link to "Item:Q5281524"
From MaRDI portal
The following pages link to On the Hardness of Approximating Stopping and Trapping Sets (Q5281524):
Displaying 3 items.
- Finding minimum stopping and trapping sets: an integer linear programming approach (Q1661914) (← links)
- On the complexity of and solutions to the minimum stopping and trapping set problems (Q2143118) (← links)
- Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs (Q5385974) (← links)