Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[KNIHA][B] Random graphs
B Bollobás, B Bollobás - 1998 - Springer
Although the theory of random graphs is one of the youngest branches of graph theory, in
importance it is second to none. It began with some sporadic papers of Erdős in the 1940s …
importance it is second to none. It began with some sporadic papers of Erdős in the 1940s …
[PDF][PDF] The differential equation method for random graph processes and greedy algorithms
NC Wormald - Lectures on approximation and randomized algorithms, 1999 - Citeseer
Random graph processes and related discrete random processes are being used
increasingly in the analysis of randomised algorithms and the study of random graphs …
increasingly in the analysis of randomised algorithms and the study of random graphs …
Algorithmic theory of random graphs
A Frieze, C McDiarmid - Random Structures & Algorithms, 1997 - Wiley Online Library
The theory of random graphs has been mainly concerned with structural properties, in
particular the most likely values of various graph invariants—see Bollobàs [21]. There has …
particular the most likely values of various graph invariants—see Bollobàs [21]. There has …
Cubic graphs
R Greenlaw, R Petreschi - ACM Computing Surveys (CSUR), 1995 - dl.acm.org
This paper is concerned with the subclass of graphs called cubic graphs. We survey these
graphs and their history. Several classical graph theory results concerning cubic graphs are …
graphs and their history. Several classical graph theory results concerning cubic graphs are …
Randomized greedy algorithms for the maximum matching problem with new analysis
It is a long-standing problem to lower bound the performance of randomized greedy
algorithms for maximum matching. Aronson, Dyer, Frieze and Suen [1] studied the modified …
algorithms for maximum matching. Aronson, Dyer, Frieze and Suen [1] studied the modified …
Greeding matching algorithms, an experimental study
J Magun - Journal of Experimental Algorithmics (JEA), 1998 - dl.acm.org
We conduct an experimental study of several greedy algorithms for finding large matchings
in graphs. Further we propose a new graph reduction, called k-Block Reduction, and present …
in graphs. Further we propose a new graph reduction, called k-Block Reduction, and present …
On the independence number of random cubic graphs
A Frieze, S Suen - Random Structures & Algorithms, 1994 - Wiley Online Library
On the independence number of random cubic graphs Page 1 On the Independence Number of
Random Cubic Graphs Alan Frieze* and Stephen Suen Department of Mathematics, Carnegie …
Random Cubic Graphs Alan Frieze* and Stephen Suen Department of Mathematics, Carnegie …
Greedy matching in bipartite random graphs
N Arnosti - Stochastic Systems, 2022 - pubsonline.informs.org
This paper studies the performance of greedy matching algorithms on bipartite graphs G=(J,
D, E). We focus primarily on three classical algorithms: RANDOM-EDGE, which sequentially …
D, E). We focus primarily on three classical algorithms: RANDOM-EDGE, which sequentially …
Probabilistic analysis of algorithms
AHGR Kan - North-Holland Mathematics Studies, 1987 - Elsevier
Publisher Summary This chapter explores the probabilistic analysis of algorithms that has
become an active research area. It reviews some representative results that are known for …
become an active research area. It reviews some representative results that are known for …
Towards addressing the patch overfitting problem
Q **n - 2017 IEEE/ACM 39th International Conference on …, 2017 - ieeexplore.ieee.org
Current automatic program repair techniques often produce overfitting patches. Such a
patch passes the test suite but does not actually repair the bug. In this paper, we propose …
patch passes the test suite but does not actually repair the bug. In this paper, we propose …