Timeline for Graphs far from being a collection of bicliques
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 6, 2010 at 22:15 | vote | accept | Jeremy H | ||
| Dec 6, 2010 at 22:12 | vote | accept | Jeremy H | ||
| Dec 6, 2010 at 22:12 | |||||
| Dec 4, 2010 at 7:57 | answer | added | Aaron Meyerowitz | timeline score: 3 | |
| Dec 3, 2010 at 23:09 | comment | added | Jeremy H | Distance is edit distance. Disjoint is vertex disjoint. Sorry for not being clear. | |
| Dec 3, 2010 at 22:36 | comment | added | Louigi Addario-Berry | I guess probably edit distance? Least number of edges in the symmetric difference of $G$ and some graph in BCC? | |
| Dec 3, 2010 at 19:31 | comment | added | JBL | And what is the distance function $d$? Also, "disjoint" means "vertex disjoint"? | |
| Dec 3, 2010 at 19:12 | history | asked | Jeremy H | CC BY-SA 2.5 |