A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
A Sequential Algorithm for Generating Random Graphs

2009
*
Algorithmica
*

We present

doi:10.1007/s00453-009-9340-1
fatcat:jtg7yaugwfas5ins6lez35sgiy
*a*nearly-linear time*algorithm**for*counting and randomly*generating*simple*graphs*with*a*given degree sequence in*a*certain range. ... We also use*sequential*importance sampling to derive fully Polynomial-time*Randomized*Approximation Schemes (FPRAS)*for*counting and uniformly*generating**random**graphs**for*the same range of d_=O(m^1/4- ... We also thank the anonymous referees*for*their great comments and suggestions. M. Bayati ...##
###
A Sequential Algorithm for Generating Random Graphs
[chapter]

2007
*
Lecture Notes in Computer Science
*

We present

doi:10.1007/978-3-540-74208-1_24
fatcat:67ak4sdo6rbl5iuu77punzhdwy
*a*nearly-linear time*algorithm**for*counting and randomly*generating*simple*graphs*with*a*given degree sequence in*a*certain range. ... We also use*sequential*importance sampling to derive fully Polynomial-time*Randomized*Approximation Schemes (FPRAS)*for*counting and uniformly*generating**random**graphs**for*the same range of d max = O(m ... We also thank the anonymous referees*for*their great comments and suggestions. M ...##
###
A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees

2011
*
Internet Mathematics
*

In this paper, we use

doi:10.1080/15427951.2010.557277
fatcat:ge33ty3zpjf63est6b3hvnhxcq
*a*characterization due to Erdős and Gallai to develop*a**sequential**algorithm**for**generating**a**random*labeled*graph*with*a*given degree sequence. ... The*algorithm*is easy to implement and allows surprisingly efficient*sequential*importance sampling. ... We thank Alex Gamburd, Susan Holmes, Brendan McKay, Richard Stanley, and Nick Wormald*for*their helpful suggestions and references. ...##
###
Sequential stub matching for uniform generation of directed graphs with a given degree sequence
[article]

2022
*
arXiv
*
pre-print

This suggests that the

arXiv:2103.15958v3
fatcat:2tggjjm6j5hmnczbl3s24yfloe
*sequential*stub matching can be viewed as*a*practical*algorithm**for*almost uniform sampling of digraphs, and we show that this*algorithm*can be implemented to feature linear expected ...*For*undirected*graphs*, randomised approximation*algorithms*have nonetheless been shown to achieve almost linear expected complexity*for*this problem. ... Erdős*for*an interesting discussion about MC*algorithms*and Niels Scholte*for**a*clever remark about constant time lookup in lists. ...##
###
A Parallel Algorithm for Generating a Random Graph with a Prescribed Degree Sequence
[article]

2017
*
arXiv
*
pre-print

In this paper, we present an OpenMP-based shared-memory parallel

arXiv:1708.07290v2
fatcat:rfzz2gpgwzdabl7yvdzkwc6qfy
*algorithm**for**generating**a**random**graph*with*a*prescribed degree sequence, which achieves*a*speedup of 20.5 with 32 cores. ... This paper presents the first non-trivial parallel*algorithm**for*checking the Erdős-Gallai characterization, which achieves*a*speedup of 23 using 32 cores. ...*A*parallel*algorithm**for**generating**a**random**graph*with*a*given expected degree sequence has been presented in [31] . ...##
###
Generation of synthetic sequential benchmark circuits

1997
*
Proceedings of the 1997 ACM fifth international symposium on Field-programmable gate arrays - FPGA '97
*

We presented

doi:10.1145/258305.258333
dblp:conf/fpga/HuttonRC97
fatcat:mog6d4lhbfb4dhfm2yb4m5lyka
*a*t o ol (circ) to extract them, and gave an*algorithm*and tool (gen) which*generates**random*circuits, parameterized by those characteristics or by*a*realistic set of defaults. ... By comparing the post-layout properties of the*generated*circuits with already existing circuits, we demonstrate that the synthetic circuits are m u c h m o r e r ealistic than*random**graphs*with the same ... Acknowledgements: The authors would like t o t h*a*n k Vaughn Betz*for*use of vpr. ...##
###
Fast Parallel Algorithms for Edge-Switching to Achieve a Target Visit Rate in Heterogeneous Graphs

2014
*
2014 43rd International Conference on Parallel Processing
*

Edge switch operations have important applications in

doi:10.1109/icpp.2014.15
dblp:conf/icpp/BhuiyanCKM14
fatcat:mq7tdop57vbrjertkn5p73vpuu
*graph*theory and network analysis, such as in*generating**random*networks with*a*given degree sequence, modeling and analyzing dynamic networks (e.g ... One of the steps in our edge switch*algorithm*requires the computation of multinomial*random*variables in parallel. The paper presents the first non-trivial parallel*algorithm**for*the problem. ...*graphs**generated*by two different runs of the*sequential**algorithm*. ...##
###
Parallel algorithms for switching edges in heterogeneous graphs

2017
*
Journal of Parallel and Distributed Computing
*

Edge switch operations have important applications in

doi:10.1016/j.jpdc.2016.12.005
pmid:28757680
pmcid:PMC5526649
fatcat:pyazmucbbfbpvjcmslm7i6wwf4
*graph*theory and network analysis, such as in*generating**random*networks with*a*given degree sequence, modeling and analyzing dynamic networks, and ... This paper presents the first non-trivial parallel*algorithm**for*the problem, achieving*a*speedup of 925 using 1024 processors. ... We are grateful to Anil Vullikanti*for*interesting discussions and helpful comments on*a*draft of this paper. ...##
###
Single-source shortest paths with the parallel boost graph library
[chapter]

2009
*
DIMACS Series in Discrete Mathematics and Theoretical Computer Science
*

The Parallel Boost

doi:10.1090/dimacs/074/09
dblp:conf/dimacs/EdmondsBGL06
fatcat:gl6pxfencbg2djp7arfbfbsiwm
*Graph*Library (Parallel BGL) is*a*library of*graph**algorithms*and data structures*for*distributed-memory computation on large*graphs*. ... Developed with the*Generic*Programming paradigm, the Parallel BGL is highly customizable, supporting various*graph*data structures, arbitrary vertex and edge properties, and different communication media ... Acknowledgements This work was supported by*a*grant from the Lilly Endowment and by NSF grants EIA-0131354 and EIA-0202048. ...##
###
An Experimental Study of a Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances
[chapter]

2007
*
2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX)
*

Our implementation exhibits remarkable parallel speedup when compared with competitive

doi:10.1137/1.9781611972870.3
dblp:conf/alenex/MadduriBBC07
fatcat:vzlqjuezajaprdd6p7tc52irfe
*sequential**algorithms*,*for*low-diameter sparse*graphs*. ...*For*instance, ∆-stepping on*a*directed scalefree*graph*of 100 million vertices and 1 billion edges takes less than ten seconds on 40 processors of the MTA-2, with*a*relative speedup of close to 30. ... Sandia is*a*multipurpose laboratory operated by Sandia Corporation,*a*Lockheed-Martin Company,*for*the United States Department of Energy under contract DE-AC04-94AL85000. ...##
###
Fast random graph generation

2011
*
Proceedings of the 14th International Conference on Extending Database Technology - EDBT/ICDT '11
*

Today, several database applications call

doi:10.1145/1951365.1951406
dblp:conf/edbt/NobariLKB11
fatcat:hsmrsslmlzcqnptt64hlg2s4dm
*for*the*generation*of*random**graphs*.*A*fundamental, versatile*random**graph*model adopted*for*that purpose is the Erdős-Rényi Γv,p model. ... In this paper, we propose PPreZER, an alternative, data parallel*algorithm**for**random**graph**generation*under the Erdős-Rényi model, designed and implemented in*a*graphics processing unit (GPU). ... 5 G ← ei;*SEQUENTIAL**ALGORITHMS*In this section we successively introduce three*sequential**algorithms**for**random**graph**generation*in the Γv,p model, namely ZER, PreLogZER and PreZER. ...##
###
Adapting Local Sequential Algorithms to the Distributed Setting

2018
*
International Symposium on Distributed Computing
*

It is

doi:10.4230/lipics.disc.2018.35
dblp:conf/wdag/KawarabayashiS18
fatcat:oa256jmgcbfcze77ueqymt27rm
*a*well known fact that*sequential**algorithms*which exhibit*a*strong "local" nature can be adapted to the distributed setting given*a*legal*graph*coloring. ... and O( −1 ) running time*for**randomized*ones. ... There exists*a*deterministic (1/2 − )-approximation*algorithms**for*weighted max-agree correlation clustering on*general**graphs*, running in O(log * n) communication rounds in the CONGEST model. ...##
###
Automatic generation of synthetic sequential benchmark circuits

2002
*
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
*

They give an

doi:10.1109/tcad.2002.800456
fatcat:wsqglxdplvgf7locu46jb2l4vu
*algorithm*(GEN)*for**generating**sequential*benchmark netlists, significantly expanding previous work (Hutton et al., 1998) which*generated*purely combinational circuits. ... They introduce an abstract model*for*describing*sequential*circuits and*a*collection of statistical parameters*for*better understanding the nature of circuits. ... ACKNOWLEDGMENT The authors would like to thank Altera Corporation*for*providing the first author with*a*summer internship, during which parts of this research were performed, and*for*allowing access to ...##
###
Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel
[chapter]

2014
*
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms
*

We show that simple

doi:10.1137/1.9781611973730.30
dblp:conf/soda/ShunGBFG15
fatcat:4gi73s3gvzh5bl5rvnow2hp63i
*sequential**randomized*iterative*algorithms**for**random*permutation, list contraction, and tree contraction are highly parallel. ... Experiments on*a*40-core machine show reasonably good performance relative to the*sequential**algorithms*. ... Computing Program, the Intel Science and Technology Center*for*Cloud Computing (ISTC-CC) and*a*Facebook Graduate Fellowship. ...##
###
Properties and Performance of the ABCDe Random Graph Model with Community Structure
[article]

2022
*
arXiv
*
pre-print

We propose ABCDe,

arXiv:2203.14899v2
fatcat:vzy3meiuqrfszmgnaajdzynl4u
*a*multi-threaded implementation of the ABCD (Artificial Benchmark*for*Community Detection)*graph**generator*. ... Moreover, the*algorithm*is not only faster but*random**graphs**generated*by ABCD have similar properties to the ones*generated*by the original LFR*algorithm*, while the parallelized NetworKit implementation ... Working together with the partners, SOSCIP is driving the uptake of AI and data science solutions and enabling the development of*a*knowledge-based and innovative economy in Ontario by supporting technical ...
« Previous

*Showing results 1 — 15 out of 145,441 results*