minimum dominating set of digraphs

harryliangye / minimum-dominating-set-exact

The fastest exact algorithm for finding minimum dominating set in a given directional graph

0 stars 0 forks source link

minimum dominating set of digraphs #1

Open haoxiaozi opened 5 years ago

haoxiaozi commented 5 years ago

Dear Ye liang, I am a student from south China university of technology in China. I am very interested in your algorithm for minimum dominating set of digraphs. In order to understand this implementation process of your C program, could you recommend some references about this algorithm? I'm truly grateful for your help.

Best regards, Qingji

harryliangye commented 5 years ago

Hi Qingji, That was my course project when I was doing my master in computer science at the University of Victoria. The professor was Wendy Myrvold who is one of the top researchers in this field. And the course name is CSC 422/522- Graph Algorithms. I'm confident that you can find some publicly available course materials online which will cover this algorithm. Let me know if you need any further help.

Cheers, Ye

haoxiaozi commented 5 years ago

thank you very much