[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[igraph] edge domination in igraph?
|
From: |
Moses Boudourides |
|
Subject: |
[igraph] edge domination in igraph? |
|
Date: |
Fri, 20 Apr 2012 13:21:41 +0300 |
Hi,
I know that finding a minimum edge dominating set is an NP-hard
problem. However, I was wondering whether there is an approximation
algorithm which is implemented in igraph. Actually, approximating the
size of the smallest maximal matching would be the same.
Any ideas?
Best,
--Moses
- [igraph] edge domination in igraph?,
Moses Boudourides <=