Timeline for What are the applications of hypergraphs?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 22, 2022 at 23:04 | history | edited | LSpice | CC BY-SA 4.0 |
Name of article, while this is on the front page
|
| Jan 20, 2021 at 22:02 | history | edited | Ed. | CC BY-SA 4.0 |
working URL
|
| Dec 22, 2014 at 1:33 | history | made wiki | Post Made Community Wiki by Todd Trimble | ||
| Jul 20, 2010 at 17:34 | comment | added | András Salamon | Hypergraphs (with no uniformity restriction) are also the natural way to model clause sets of general SAT. Each hyperedge represents the single set of literals that is forbidden by some clause. These structures have also been studied in constraint satisfaction, under the name microstructure complements. The hyperedges are there colourfully called "nogoods", a name coined by Stallman and Sussman in 1976 (yes, the Richard Stallman). hdl.handle.net/1721.1/6255 | |
| Feb 2, 2010 at 0:35 | history | answered | Ryan O'Donnell | CC BY-SA 2.5 |