GreedyMAX

GreedyMAX-type algorithms for the maximum independent set problem

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 5 articles , 1 standard article )

Showing results 1 to 5 of 5.
Sorted by year (citations)

  1. Borowiecki, Piotr; Rautenbach, Dieter: New potential functions for greedy independence and coloring (2015)
  2. Caro, Yair; Pepper, Ryan: Degree sequence index strategy (2014)
  3. Bojilov, Asen; Caro, Yair; Hansberg, Adriana; Nenov, Nedyalko: Partitions of graphs into small and large sets (2013)
  4. Borowiecki, Piotr; Göring, Frank; Harant, Jochen; Rautenbach, Dieter: The potential of greed for independence (2012)
  5. Borowiecki, Piotr; Göring, Frank: GreedyMAX-type algorithms for the maximum independent set problem (2011)