Timeline for Finding maximal independent sets in an independence system
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 13, 2018 at 15:02 | vote | accept | Jack M | ||
| Jun 28, 2017 at 22:33 | comment | added | Aaron Rotenberg | If you know a little more about the oracle instead of just treating it as a total black box, then more algorithms are available. For example, if you can efficiently test incrementally whether adding a single element to an independent set makes the set dependent, then you can use the algorithm from Bailey and Stuckey (2005). "Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization." | |
| May 27, 2017 at 19:14 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Apr 27, 2017 at 18:17 | history | edited | Raphael |
edited tags
|
|
| Apr 27, 2017 at 18:14 | history | edited | D.W.♦ | CC BY-SA 3.0 |
added 177 characters in body
|
| Apr 27, 2017 at 18:06 | answer | added | D.W.♦ | timeline score: 2 | |
| Apr 27, 2017 at 12:34 | history | asked | Jack M | CC BY-SA 3.0 |