id,summary,reporter,owner,description,type,status,priority,milestone,component,resolution,keywords,cc,merged,author,reviewer,upstream,work_issues,branch,commit,dependencies,stopgaps
7487,Random Interval Graphs,ncohen,rlm,"This patch definesRandom Interval Graph, as explained in the docstring :
{{{
An interval graph is built from a list `(a_i,b_i)_{1\leq i \leq n}`
of intervals : to each interval of the list is associated one
vertex, two vertices being adjacent if the two corresponding
intervals intersect.
A random interval graph of order `n` is generated by picking
random values for the `(a_i,b_j)`, each of the two coordinates
being generated from the uniform distribution on the interval
`[0,1]`.
}}}",enhancement,closed,major,sage-4.3,graph theory,fixed,,,sage-4.3.alpha1,Nathann Cohen,Mike Hansen,N/A,,,,,