Pages that link to "Item:Q778157"
From MaRDI portal
The following pages link to On the maximum independent set problem in graphs of bounded maximum degree (Q778157):
Displaying 13 items.
- A sufficient condition to extend polynomial results for the maximum independent set problem (Q344869) (← links)
- A simple proof that finding a maximal independent set in a graph is in NC (Q834937) (← links)
- An exact algorithm for maximum independent set in degree-5 graphs (Q896662) (← links)
- An optimal maximal independent set algorithm for bounded-independence graphs (Q992507) (← links)
- The maximum independent set problem in subclasses of subcubic graphs (Q2346341) (← links)
- New properties of maximum independent set problem solution truncation rules or redundant branches (Q2737186) (← links)
- On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs (Q2870037) (← links)
- (Q3070898) (← links)
- The max quasi-independent set Problem (Q3569731) (← links)
- Constructing concrete hard instances of the maximum independent set problem (Q5149679) (← links)
- Further Improvement on Maximum Independent Set in Degree-4 Graphs (Q5199148) (← links)
- An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs (Q5405918) (← links)
- Computing maximum independent set on outerstring graphs and their relatives (Q5918655) (← links)