Erdős - PDFSEARCH.IO - Document Search Engine

Erdős
Results: 147

#	Item
41	Automatic Generation of Graph Models for Complex Networks by Genetic Programming Alexander Bailey Mario Ventresca Add to Reading List Source URL: www.genetic-programming.org Language: English - Date: 2013-06-23 23:45:55 Network theory Graph Random graphs Centrality Connectivity Evolving networks Small-world network Null graph Erdős–Rényi model Graph theory Mathematics Networks
42	Journal of Artificial Intelligence Research226 Submitted 1/14; publishedSensitivity of Diffusion Dynamics to Network Uncertainty Abhijin Adiga Add to Reading List Source URL: jair.org Language: English - Date: 2014-09-30 02:43:12 Random graph Connectivity Degree distribution Giant component Network science Erdős–Rényi model Graph theory Mathematics Centrality
43	Remarks on bootstrap percolation in metric networks Add to Reading List Source URL: www.weizmann.ac.il Language: English - Date: 2009-05-05 22:21:12 Degree distribution Topology Connectivity Scale-free network Networks Regular graph Degeneracy Erdős–Rényi model Complex network zeta function Graph theory Network theory Random graph
44	math 420 FINAL EXAM Monday December 13, 1993 Add to Reading List Source URL: www.math.hawaii.edu Language: English - Date: 2001-04-07 05:48:32 Diophantine equations Prime number Quadratic forms Erdős–Straus conjecture Primality certificate Mathematics Integer sequences Number theory
45	AN EQUIVALENT FORM OF THE DUJELLA UNICITY CONJECTURE The Dujella unicity conjecture states that the diophantine equation x2 − (k 2 + 1)y 2 = k 2 Add to Reading List Source URL: www.numbertheory.org Language: English - Date: 2014-11-27 21:12:16 Euclidean algorithm Diophantine equations Mathematics Erdős–Straus conjecture
46	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 On distinct distances among points in general position and other related problems Adrian Dumitrescu∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:04:02 Mathematical analysis Complex number Big O notation Lattice Erdős distinct distances problem Geometry Mathematics Discrete geometry
47	CCCG 2006, Kingston, Ontario, August 14–16, 2006 Polygons Flip Finitely: Flaws and a Fix Erik D. Demaine∗ Blaise Gassend† Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-27 22:58:31 Simple polygon Vertex Convex hull Quadrilateral Convex and concave polygons Internal and external angle Pseudotriangle Erdős–Nagy theorem Geometry Polygons Euclidean plane geometry
48	CCCG 2011, Toronto ON, August 10–12, 2011 Collinearities in Kinetic Point Sets Ben D. Lund∗ George B. Purdy† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:15 Conic sections Discrete geometry Elementary geometry Line Plane Ellipse De Bruijn–Erdős theorem Sylvester–Gallai theorem Geometry Euclidean plane geometry Analytic geometry
49	CCCG 2009, Vancouver, BC, August 17–19, 2009 Rigid Components of Random Graphs Louis Theran∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2009-09-02 14:23:35 Structural rigidity Laman graph Degeneracy Connectivity Tree Dense graph Erdős–Rényi model Pseudoforest Graph theory Mathematics Random graph
50	CCCG 2011, Toronto ON, August 10–12, 2011 Collinearities in Kinetic Point Sets Ben D. Lund∗ George B. Purdy† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:15 Conic sections Discrete geometry Elementary geometry Line Plane Ellipse De Bruijn–Erdős theorem Sylvester–Gallai theorem Geometry Euclidean plane geometry Analytic geometry