GreedyMAX

swMATH2058MaRDI QIDQ14603FDOQ14603

Author name not available (Why is that?)

Described by source

• GreedyMAX-type algorithms for the maximum independent set problem

Cited In (4)

• The potential of greed for independence
• Partitions of graphs into small and large sets
• Degree sequence index strategy
• New potential functions for greedy independence and coloring

This page was built for software: GreedyMAX