✦ LIBER ✦

Algorithmic theory of random graphs

✍ Scribed by Alan Frieze; Colin McDiarmid

Publisher: John Wiley and Sons
Year: 1997
Tongue: English
Weight: 318 KB
Volume: 10
Category: Article
ISSN: 1042-9832
DOI: 10.1002/(sici)1098-2418(199701/03)10:1/2<5::aid-rsa2>3.0.co;2-z

No coin nor oath required. For personal study only.

✦ Synopsis

The theory of random graphs has been mainly concerned with structural w x properties, in particular the most likely values of various graph invariantsᎏsee Bollobas 21 .

There has been increasing interest in using random graphs as models for the average case analysis of graph algorithms. In this paper we survey some of the results in this area. ᮊ 1997 Ž .

📜 SIMILAR VOLUMES

Algorithms for coloring semi-random grap

Algorithms for coloring semi-random graphs

✍ C. R. Subramanian; Martin Fürer; C. E. Veni Madhavan 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 373 KB 👁 1 views

The graph coloring problem is to color a given graph with the minimum number of colors. This problem is known to be NP-hard even if we are only aiming at approximate solutions. On the other hand, the best known approximation algorithms require ␦ Ž . Ž . n ␦ ) 0 colors even for bounded chromatic k-co

1-Factorizations of random regular graph

1-Factorizations of random regular graphs

✍ M. S. O. Molloy; H. Robalewska; R. W. Robinson; N. C. Wormald 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB 👁 2 views

It is shown that for each r G 3, a random r-regular graph on 2 n vertices is equivalent in a certain sense to a set of r randomly chosen disjoint perfect matchings of the 2 n vertices, as n ª ϱ. This equivalence of two sequences of probabilistic spaces, called contiguity, occurs when all events almo

Growth of components in random graphs

✍ Svante Janson 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB 👁 1 views

Handbook of Applied Algorithms || Algori

Handbook of Applied Algorithms || Algorithmic Game Theory and Applications

✍ Nayak, Amiya; Stojmenovi, Ivan 📂 Article 📅 2008 🏛 John Wiley & Sons, Inc. 🌐 English ⚖ 193 KB

discover The Benefits Of Applying Algorithms To Solve Scientific, Engineering, And Practical Problems Providing A Combination Of Theory, Algorithms, And Simulations, Handbook Of Applied Algorithms Presents An All-encompassing Treatment Of Applying Algorithms And Discrete Mathematics To Practi

Random Amalgamation of Simple Theories

✍ Akito Tsuboi 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 132 KB

Classification of polymer structures by

Classification of polymer structures by graph theory

✍ S. M. Patra; S. Vishveshwara 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 189 KB 👁 1 views

Compact polymers such as proteins obtain their unique conformation by appropriate nonbonded interactions among their monomer residues. Innumerable nonnative compact conformations are also possible, and it is essential to distinguish the native from the nonnative conformations. Toward this goal we ha