id,summary,reporter,owner,description,type,status,priority,milestone,component,resolution,keywords,cc,merged,author,reviewer,upstream,work_issues,branch,commit,dependencies,stopgaps
29431,certificate based radius for undirected unweighed graphs,gh-ArchitWagle,,"This ticket implements the radius algorithm given in http://arxiv.org/abs/1803.04660
It performs very well
( >90% reduction in execution time on all graphs I tried)
{{{
: G = Graph(4)
....: while not G.is_connected():
....: G = graphs.RandomGNP(10000,0.008)
....:
sage: %time G.radius()
CPU times: user 23min 30s, sys: 4min 9s, total: 27min 39s
Wall time: 27min 39s
3
sage: %time G.radius(algorithm=""radius-certificate"")
CPU times: user 231 ms, sys: 4.38 ms, total: 236 ms
3
}}}
",enhancement,closed,major,sage-duplicate/invalid/wontfix,graph theory,duplicate,"graph, gsoc, radius",,,,David Coudert,N/A,,u/gh-ArchitWagle/certificate_based_radius_for_undirected_unweighed_graphs,6dd478d063b40493ccc136831acfebfa1c92325c,,