Pages that link to "Item:Q293369"
From MaRDI portal
The following pages link to An \(O(n^3)\) time algorithm for recognizing threshold dimension 2 graphs (Q293369):
Displaying 6 items.
- Recognizing strict 2-threshold graphs in O(m) time (Q673666) (← links)
- An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs (Q2373437) (← links)
- Ond-threshold graphs andd-dimensional bin packing (Q3157035) (← links)
- A Graph Theoretic Approach to Solve Special Knapsack Problems in Polynomial Time (Q4685763) (← links)
- The lexicographic method for the threshold cover problem (Q5925705) (← links)
- Linear-time recognition of double-threshold graphs (Q5970798) (← links)