506 c File: sanr200_0.9.clq c c SOURCE: Laura Sanchis (laura@cs.colgate.edu) c c DESCRIPTION: Randomly generated graph of similar size to "san" c graphs, but with differenct clique characteristics c c REFERENCE: "Test Case Construction for the Vertex Cover Problem", c DIMACS Workshop on Computational Support for Discrete Mathematics, c March, 1992, with additional work in a to be published technical c report. c c random graph 200 vertices 17863 edges c 200 0.100000 3827 p edge 200 17863 ?@@p}}:o]o~w?}_w_ۭ~w/߿.?~߀~?_o_ww?u?~?x~Ou~={{{{_{_7l}?}?u~o~___w|~ow~{~{}}?}?w?ow>w?o߀ߦ~woh_}߾?}߽o{ۯ_}_ޭ_߿w{޿ۻ}w{?޿xg{k}w}}_?շ?ݽs7˻ow_w߿g=o?;׿߿w?_w_W?o꿯m_o{w?_w