Timeline for A Min Max problem for graphs? Is it well-known?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 4, 2011 at 22:56 | answer | added | Alfredo Hubard | timeline score: 6 | |
| Nov 4, 2011 at 21:33 | answer | added | Igor Rivin | timeline score: 3 | |
| Nov 4, 2011 at 21:28 | comment | added | Igor Rivin | It might help if you made some comments about where the problem comes from. My guess is that it is not particularly tractable algorithmically. | |
| Nov 4, 2011 at 20:36 | comment | added | Barry Cipra | At the risk of sending you on a 200-page wild goose chase, I'd suggest taking a look at Joe Gallian's Dynamic Survey of Graph Labeling, combinatorics.org/Surveys/ds6.pdf | |
| Nov 4, 2011 at 20:09 | history | asked | Alireza Abdollahi | CC BY-SA 3.0 |