Pages that link to "Item:Q2804023"
From MaRDI portal
The following pages link to On the independent set problem in random graphs (Q2804023):
Displaying 13 items.
- Random maximal independent sets and the unfriendly theater seating arrangement problem (Q1044988) (← links)
- Randomly finding independent sets in locally sparse graphs (Q2099383) (← links)
- On threshold probability for the stability of independent sets in distance graphs (Q2282860) (← links)
- Approximating independent set in perturbed graphs (Q2446304) (← links)
- The resolution complexity of independent sets and vertex covers in random graphs (Q2474203) (← links)
- On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph (Q3222867) (← links)
- Finding a Maximum Independent Set in a Sparse Random Graph (Q3629470) (← links)
- Independent sets in random sparse graphs (Q3701457) (← links)
- Hard graphs for randomized subgraph exclusion algorithms (Q5054768) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479377) (← links)
- (Q5687250) (← links)
- Experimental and Efficient Algorithms (Q5710051) (← links)
- Simulating independence (Q5901100) (← links)