shor@RESEARCH.ATT.COM (Peter Shor) (06/04/91)
I'm interested in heuristics for the feedback vertex set problem. This problem is: given a directed graph, remove as few vertices as possible so as to break all cycles. I'm also interested in a variation of this problem, where the nodes are colored, and if you remove one node of a given color, you must remove them all. Does anyone have pointers to good heuristics? Thanks, Peter Shor AT&T Bell Labs 600 Mountain Ave, Rm. 2D-149 Murray Hill, NJ 07974 shor@research.att.com