Revision as of 03:42, 15 March 2020 (view source) Hkdtam (talk \| contribs) (→‎Any tougher problems?) ← Older edit		Revision as of 21:11, 15 March 2020 (view source) Petelomax (talk \| contribs) (→‎Any tougher problems?) Newer edit →
Line 9: Are there any ready-made problems knocking about which might (frinst) give exhaustive search pause for thought? --[[User:Petelomax\|Pete Lomax]] ([[User talk:Petelomax\|talk]]) 22:37, 14 March 2020 (UTC) :If you mean larger data sets you may take a look at [https://snap.stanford.edu/data/#socnets here], I haven't tried yet but did take a peek at one [https://snap.stanford.edu/data/bigdata/communities/com-dblp.ungraph.txt.gz sample] and it seems ready to be used. Hope this helps. --[[User:Hkdtam\|Hkdtam]] ([[User talk:Hkdtam\|talk]]) 03:39, 15 March 2020 (UTC) ::Hmm, 317,080 nodes and 1,049,866 edges (for the example you peeked at) is far more than I would ever have imagined... --[[User:Petelomax\|Pete Lomax]] ([[User talk:Petelomax\|talk]])

Talk:Graph colouring: Difference between revisions

Talk:Graph colouring (view source)