A Note on Two Problems in Connexion with Graphs.
E.W. DIJKSTRA (1959)
Numerische Mathematik
Similarity:
Displaying similar documents to “Random Matrices and Graphs.”
A Note on Two Problems in Connexion with Graphs.
Upper bounds on the non-3-colourability threshold of random graphs.
Fountoulakis, Nikolaos, McDiarmid, Colin (2002)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Regularities in Congruential Random Number Generators.
G. MARSAGLIA (1970/71)
Numerische Mathematik
Similarity:
Paths of specified length in random -partite graphs.
Subramanian, C.R. (2001)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
On pendant vertices in random graphs
Zbigniew Palka (1981)
Colloquium Mathematicae
Similarity:
On the Computation of Inclusion Regions for Partitioned Matrices.
R.L. Johnston, D.D. Olesky (1972)
Numerische Mathematik
Similarity:
On the Eigenproblem for Normal Matrices.
H.J. de Vries (1973)
Numerische Mathematik
Similarity:
Optimally Conditioned Vandermonde Matrices.
W. Gautschi (1975)
Numerische Mathematik
Similarity:
Solution of Partial Differential Equations by a Modified Random Walk.
S. Hoshino, K. Ichida (1971/72)
Numerische Mathematik
Similarity:
A Constructive Method of Solving the Liapounov Equation for Complex Matrices.
R. Meyer-Spasche (1972)
Numerische Mathematik
Similarity: