HDTenEightyP/NetNews huggingface dataset:
From: 0005013469@mcimail.COM (Jean-Bernard Condat)
Newsgroups: comp.theory.cell-automata
Subject: Golden Section and Music
Date: 11 Apr 92 08:47:00 GMT
Distribution: inet
Organization: The Internet

-------Please Followed To Other Bulletin Boards--Thanks-----------------

Date:     Wed Apr 08, 1992  7:49 am  GMT
From:     Jean-Bernard Condat / MCI ID: 501-3469
 
TO:       Doug Scalfano
          EMS: TI / MCI ID: 400-6329
          MBX: SU=Scalfano
          MBX: GI=Doug
TO:       Doug Scalfano
          EMS: TI / MCI ID: 400-6329
          MBX: SU=Scalfano
          MBX: GI=Doug
TO:       Tinuke Ige / MCI ID: 342-9006
CC:       rmonmib
          EMS: INTERNET / MCI ID: 376-5414
          MBX: rmonmob@lexcel.com
Subject:  Golden Section and Music
Message-Id: 30920408074903/0005013469PK2EM
 


   Golden Section And Music

   Edited by Jean-Bernard Condat
   Frankfurt/Main, Berne, New York, Paris: 1988. 186 pages
   Nr. 19 of "Quellen und Studien zur Musikgeschichte von der Antike bis
in die Gegenwart"
   ISBN 3-631-40347-X
   br./lam. sFr. 42.--

   Is there an original element that serve as a link between all areas of
musicology? Is not musical form mostly based on two constitutive parts, the
one positive and the other negative? How can it be explained that, in
organology, modern instrument-making and the physical as well as
aesthetical speculations of the Renaissance are so directly related?
   There is only one plausible answer: the Golden Section.

   Order (in US): Peter Lang Publishing, Inc., 62 West 45th Street,
                  New York, NY  10036.
   Other order addresses available on request.

   Editor's address: Jean-Bernard Condat, B.P. 8005, 69351 Lyon 08, France
Newsgroups: comp.theory.cell-automata
From: tjebelea@risc.uni-linz.ac.at (Tudor Jebelean)
Subject: CA hardware?
Reply-To: tjebelea@risc.uni-linz.ac.at (Tudor Jebelean)
Organization: RISC, J.K. University of Linz, Austria
Distribution: inet
Date: Tue, 7 Apr 1992 10:38:51 GMT


My institute (RISC - Linz) is planning to buy some hardware based
on the cellular automata and/or systolic approach.

Can somebody help me with some hints on how to find information
about such devices available on the market?

Are there people which have already used such devices and who would
help me with a [short] description of their experience?

Thank you very much,

Tudor Jebelean            Phone: Austria-7236-3231-20
RISC - Linz,              Fax:   Austria-7236-3338-30
A-4040 Linz, Austria      E-mail: tjebelea@risc.uni-linz.ac.at

Newsgroups: comp.theory.cell-automata
From: wli@physics-sun.ROCKEFELLER.EDU (Wentian Li)
Subject: CA on random lattices vs random nets
Organization: The Internet
Distribution: inet
Date: Tue, 7 Apr 1992 05:41:53 GMT


--------------------------------------------------------------------------
>From: mcintosh@uapnx1.dgsca.unam.mx (Harold V. McIntosh)
>Date: Mon, 6 Apr 92 10:10:20 MEX

>Bill Tozier/Vaguery <bill@AMY.MED.UPENN.EDU> (Fri, 27 Mar 1992 10:03:37  
>EST) inquires, among other things:

>> Has anyone examined CA on (fixed) random graphs, rather that regular
>>   tilings?

>There must be numerous references for this. Try: [Stuart A. Kauffman,  
>Emergent properties in random complex automata, Physica 10D 145-156 (1984)].
>Random graphs have marvellous properties; he alludes to some of them. 
>Try also: [Max Garzon, Cellular automata and discrete neural networks,  
>Physica D45 431-440 (1990)] and: [C.C. Walker, Attractor dominance  
>petterns in sparsely connected boolean nets, Physica D45 441-451 (1990)].  
>Both articles come from an issue of Physica D that was a conference  
>proceeding, edited by Howard Gutowitz, now reprinted by the MIT Press.
>These references are the tip of an iceberg; each contains further  
>references and constitute backwards pointers for Science Citation Index.
--------------------------------------------------------------------------
 
Well, this is not correct. In Stu Kauffman's random nets, each site
picks randomly a few (e.g. 2) other sites as its inputs. For example,
site (1) picks sites (5) and (8), site (5) picks sites (2) and (5)...
So there is an asymmetry in the connection; in other words, the
connection is accompanied by arrows. Using the above example, there
is an arrow from site (5) to (1), but *no* arrow from (1) to (5).

On the other hand, CA on a random graphs (random lattice) doesn't
have this bias. If site (1) and site (2) are nearest neighbors
by a connection, the two take inputs from each other (i.e., not
only (1) takes input from (2), but also (2) takes input from (1)). 

Similarly, the reference to Crayton Walker's work is also not
appropriate. Again, the "information flow" in his case is one-way
instead of two-way.

I will be surprised if a CA on a random lattice shows qualitatively
different dynamics compared with the same CA on a regular lattice.
But, I might be wrong (though I would think this guess is correct
for most cases). Note, one has to make sure that the number of
inputs (number of nearest neighbors) is the same for all lattice sites.
Not every algorithm for generating random lattice can do that (e.g.,
the algorithm which makes a connection between any two points if
the distance between them is smaller than a given radius. Then
the number of connections for each site will not be a constant...).


Wentian Li
Box 167, Rockefeller University
1230 York Avenue, NY, NY 10021
wli@physics-sun.rockefeller.edu


Newsgroups: comp.theory.cell-automata
From: hiebeler@Think.COM (Dave Hiebeler)
Subject: cellsim under XWindows
Organization: The Internet
Distribution: inet
Date: Mon, 13 Apr 1992 13:13:50 GMT


  I am slowly working on an X11 version of Cellsim, as well as a CM-5
back-end.  I don't have very much time to devote to the project right
now, but I have a very basic bare-bones version running, and I will
send out an announcement when I have something that is mostly
functional.

--
Dave Hiebeler                  | hiebeler@think.com
Thinking Machines Corporation  | (617) 234-4070
From: gaylord@UX1.CSO.UIUC.EDU
Newsgroups: comp.theory.cell-automata
Subject: 3-D automata
Date: 6 Apr 92 17:13:51 GMT
Article-I.D.: ux1.199204061713.AA28637

Harold V. MacIntosh writes:

The name often associated with 3-D automata is Carter Bays, who has  
published in Complex Systems over the years, and was featured in A.K.  
Dewdney's "Computer Recreations" column in Scientific American. The  
specific issue, cover adorned by a 3-D automaton, was February, 1987;  
three of his Complex Systems articles appeared the same year.

====================================
i sent Bays a request some time ago for his articles and I asked for his
programs. I included a disk  a self-addressed, stamped envelope and also
money (the Dewdney S.A. article said Bays would send you his programs if
you did this). Bays sent me his articles but he did not return the disk or
the self-addressed envelope. he also kept the money.
From: hfry@imag.imag.fr (Herve Frydlender)
Newsgroups: comp.theory.cell-automata
Subject: Conway's Game of Live
Date: 15 Apr 92 14:10:15 GMT
Organization: Institut Imag, Grenoble, France

Could someone send me references (in bibtex form if possible) of books or
articles written by Conway on it's Game of Live.

Many thanks

-- 
Herve Frydlender ------------------------------------------------------------

 LMC-IMAG
 Equipe Algorithmique Parallele                     hfry@alize.imag.fr 
 INPG - 46, Av. Felix Viallet                       Tel. (33) 76 57 48 73  
 38031 Grenoble Cedex (FRANCE)                      Fax. (33) 76 57 47 54  
-----------------------------------------------------------------------------
Newsgroups: comp.theory.cell-automata
From: KOSTIC31288D%BUEFQ5@yubgef51.BITNET ("Dejan Kostic-University of Belgrade, Yugoslavia")
Subject: Subcribe
Organization: The Internet
Distribution: inet
Date: Mon, 6 Apr 1992 20:48:00 GMT


                                Dear sir,


        My name is Dejan Kostic. I live in Yugoslavia (if it still
  exists :) ). I'm at the School of Electrical Engineering, University
  of Belgrade, 3rd year undergraduate studies. I'm studying Computer
  Science, and I'm listening (and participating) in Graduate studies
  concerning Neural-networks. My interests are both software and
  hardware implementations of ANN, but I prefer latter ones. Also
  I think the cellular automata are the right way to fight the limit-
  ting factors in VLSI, and obvious impossibility of connnecting one
  neuron output to a large number of other neurons, and still retaining
  large number of neurons. I must say that I would be delighted if
  I could see "what's going on" on this conf. Also, is there any
  possibility for me to receive back issues, because Princeton FTP
  server refuses to work with me, since my node isn't directly on
  BitNet :(.
         Please, put me on the list,

                                                Thank you,
                                                        Dejan

Newsgroups: comp.theory.cell-automata
From: fcr@baron.ncsa.uiuc.edu (Fred Richards)
Subject: Re: CA on random lattices vs random nets
Keywords: quasicrystals,penrose,renormalization
Organization: University of Illinois at Urbana
Distribution: inet
Date: Tue, 7 Apr 1992 14:52:32 GMT

In article <9204070541.AA02913@physics-sun.rockefeller.edu>  
wli@physics-sun.ROCKEFELLER.EDU (Wentian Li) writes:
> 
> >Bill Tozier/Vaguery <bill@AMY.MED.UPENN.EDU> (Fri, 27 Mar 1992 10:03:37  
> >EST) inquires, among other things:
> 
> > Has anyone examined CA on (fixed) random graphs, rather that regular
> >   tilings?
>
> I will be surprised if a CA on a random lattice shows qualitatively
> different dynamics compared with the same CA on a regular lattice.
> 

I, too, would be surprised to see qualitatively different results.
In a somewhat tangent, but related situation, people have investigated
the Ising model on a 2-D Penrose lattice and compared it to a regular
lattice.  The results they obtained, both numerically and through
more "analytic" means (a renormalization group study) showed the two
systems to belong to the same universality class, and to exhibit essentially
the same qualitative behavior.

	Fred Richards
	NCSA / Beckman Institute
	U. of Illinois, Urbana-Champaign
	405 N. Mathews Ave, Urbana, IL 61801

REFERENCES:
Hideaki Aoyama and Takashi Odagaki, "Renormalization Group Analysis of
the Ising Model on Two-Dimensional Quasi-Lattices", Int. J. Mod. Phys. B2(1)
13-35 (1988).

T. C Choy, "Ising Models on Two-Dimensional Quasi-Crystals: Some Exact
Results", Int. J. Mod. Phys. B2(1) 49-63 (1988).

Anita Doraba, "Equivalence of the Ising Model on the 2-D Penrose
and 2-D Regular Lattice", Acta Physica Polonica A76(5) 949-953 (1989).

and a related paper

Youyan Liu and Penghui Ma, "Electronic Properties of Two-Dimensional
Quasicrystals with Near-Neighbor Interactions", Phys. Rev. B 43(2) 
1378-1384 (1991).
Newsgroups: comp.theory.cell-automata
From: mittle@watson.ibm.com (Josh Mittleman)
Subject: Triangulation algorithms
Date: Fri, 10 Apr 1992 17:59:59 GMT
Disclaimer: This posting represents the poster's views, not necessarily those of IBM
Organization: IBM T.J. Watson Research Center

I am looking for a good triangulation algorithm for simply-connected
polygons.  I recall a reference to a fairly straightforward O(n(log*)(n))
time algorithm; can someone give me the reference? 

Thanks.

===========================================================================
Josh Mittleman (mittle@watson.ibm.com)
J2-C28 T.J. Watson Research Center, PO Box 704, Yorktown Heights, NY  10598
Newsgroups: comp.theory
From: odevil@sophia.inria.fr (Olivier Devillers,L025,657763)
Newsgroups: comp.theory
Subject: Re: Triangulation algorithms
Date: 15 Apr 92 11:39:35 GMT
Originator: odevil@sargas.inria.fr

From article <1992Apr10.175959.13856@watson.ibm.com>, by mittle@watson.ibm.com (Josh Mittleman):
> I am looking for a good triangulation algorithm for simply-connected
> polygons.  I recall a reference to a fairly straightforward O(n(log*)(n))
> time algorithm; can someone give me the reference? 


 
For a triangulation : 
  
@article{Seid3,
author = "R. Seidel",
title = "A simple and Fast Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons",                
journal = "Computational Geometry Theory \& Applications",
pages = "51-64",
number = 1,    
year = 1991,
volume = 1 
}

For the edge Delaunay triangulation :

@article{logstar,
author = "O. Devillers",
title = {Randomization yields simple {$O(n\log^{\star} n)$} algorithms for difficult {$\Omega(n)$} problems},
journal = "International Journal of Computational Geometry \& Applications",
page= "621-635",
volume=2,
number=1, 
year=1992, 
month=mar 
} 
   

-- 
  _               __  __    ___  __               __  __   __ Tel:+33 93657763
 / / /   / | / / /_  /_/    / / /_ | / / /   /   /_  /_/  /_  Telex: 970 050F
/_/ /__ /  |/ / /__ /  \  _/_/ /__ |/ / /__ /__ /__ /  \ __/  Fax:+33 93657643
INRIA - BP 93 - 06902 Sophia Antipolis Cedex (France)                                                                              Olivier.Devillers@inria.fr
From: ross@spam.ua.oz.au (Ross Williams)
Newsgroups: comp.theory
Subject: CALL FOR DISCUSSION: COMP.COMPRESSION.THEORY.
Summary: CALL FOR DISCUSSION: COMP.COMPRESSION.THEORY.
Keywords: comp.compression.theory new group
Date: 14 Apr 92 04:59:03 GMT
Followup-To: news.groups
Organization: Statistics, Pure & Applied Mathematics, University of Adelaide


CALL FOR DISCUSSION: COMP.COMPRESSION.THEORY
============================================
It is proposed that a new newsgroup be created:

   Name    : comp.compression.theory
   Charter : Discussions about data compression algorithms.
   Status  : Unmoderated.

Many researchers have stopped reading comp.compression because of the
volume of non-research traffic (e.g. postings with subject fields such
as "Where can I get Unix compress for MSDOS?"). There is now a strong
need for a newsgroup that can provide a forum for more theoretical
discusions about data compression and data compression algorithms.
Such a newsgroup would assist those who are actually involved in
understanding and developing new algorithms as opposed to merely using
them.

The suffix ".theory" is designed to scare off those who want to
discuss specific computer programs. The term "algorithms" in the
charter is designed to lure back those who got so scared that they
decided it must be a newsgroup for information theorists. It is
intended that the scope of the newsgroup range from information theory
to practical algorithm construction, but no further.

Timetable
---------
Tue 14-Apr-1992 Call for discussion (deadline for agreement 14-May-1992).
Tue 28-Apr-1992 Call for votes.
Thu 21-May-1992 Last day on which votes will be received.
Fri 22-May-1992 Posting of vote tally. 5 day waiting period.
Thu 28-May-1992 Creation of comp.compression.theory.

In accordance with the guidelines for newgroup creation, discussion
about the creation of this newsgroup will take place in "news.groups".

I am sending this message to a few key newsgroups and also to all
those who voted in the comp.compression vote about one year ago. I
urge you to support this proposal which has the potential to
significantly assist data compression researchers around the world.

Ross Williams
ross@spam.adelaide.edu.au
(Creator of comp.compression)
From: arun@bayou05.cacs.usl.edu (Arun Lakhotia)
Newsgroups: comp.theory
Subject: WARM schedule, etc.
Date: 15 Apr 92 22:42:37 GMT
Article-I.D.: bayou05.ARUN.92Apr15164237
Reply-To: arun@gator.cacs.usl.edu (Arun Lakhotia)
Distribution: usa
Organization: /home/u14/lakhotia/arun/.organization


The 5th Workshop on Algorithmic Research in the MidSouth will be held
at the University of Southwestern Louisiana, Lafayette, April 24-25,
1992.

Attendance is free and open to all.

The workshop coincides with the nth Festival International de
Louisiane ... a week long festival of international food and music.

Digitized map of Lafayette is available via anonymous ftp from
basin.cacs.usl.edu (130.70.32.51) files -- lafayette-map.eps and
lafayette-map.tif (The first is in postscript format and the second in
tif format).

For further details -- contact arun@cacs.usl.edu, (318) 231-6766

The schedule of the workshop is appended.

Arun Lakhotia


====== schedule =====

.ce 1
\f3Friday, April 24, 1992\f1
.TS
expand;center
l l.

8:30 - 9:00	Breakfast

9:00 - 10:00	Keynote speech,
	Sartaj Sahni, University of Florida, Gainesville
	\f2Graph vertex modification problems and applications\f1

10:00 - 10:30	Break

10:30 - 11:30	Honghua Yang, University of Texas, Austin
	\f2Improved Parallel Algorithms for
	the Planar Monotone Circuit Value
	Problem\f1

11:30 - 12:30	Rajiv Bagai and Mahesh Rathi, Wichita State University
	\f2A Congestion Lower Bound for
	Multiarity Hypercube Embeddings\f1

12:30 - 2:00	Lunch

2:00 - 3:00	Cetin Kaya Koc, University of Houston
	\f2Parallel Algorithms for Exact
	Solution of Linear Equations\f1

3:00 - 3:10	Break

3:10 - 4:10	Abdelguerfi, Dunham, Patterson, University of New Orleans
	\f2AMatrix Multiplication on a Toroidal 
           Parallel Architecture\f1

4:10 - 4:20	Break

4:20 - 5:20 	Si-Qing Zheng, Louisiana State University
	\f2Optimal Ring Embedding in Hypercube
	with Faulty Links\f1

	David Hoelzeman and Said Bettayeb, Louisiana State University
	\f2On the Genus of Star Graphs\f1
.TE	
	
	

.ce 1
\f3Saturday, April 25, 1992\f1

.TS
expand;center
l l.

8:30 - 9:00	Breakfast

9:00 - 10:00	Chung W. Ng and Gilbert H. Young, Tulane University	
	\f2Job Scheduling on Generalized Task System\f1

10:00 - 10:10	Break

10:10 - 11:10	E. Kortright, Nicholls State University

11:10 - 11:20	Break

11:20 - 12:20	Hal Sudborough, University of Texas at Dallas
	\f2Permutation Networks\f1

12:20 - 1:20	Lunch

1:20 -	2:20	Andrew Chin, Texas A&M University
	\f2All Purpose Parallel Computation\f1

	Hosame ABU-Amara and Fernando Morales, Texas A&M
	\f2Design of a Header Processor
	for Implementation of the Logical Link
	Control Protocol in LANs\f1

2:20 - 2:10	Break

2:10 - 3:10	Business meeting

.TE	
	
	


--
The Center for Advanced Computer Studies
University of Southwestern Louisiana
Lafayette, LA 70504
(318) 231-6766
From: peyote@umiacs.umd.edu (Gary W. Flake)
Newsgroups: comp.theory
Subject: P!=NP, or April fools...I don't know
Summary: Berkely claims P!=NP, plus major proof breakthrough
Date: 8 Apr 92 18:20:20 GMT
Organization: UMIACS, University of Maryland, College Park, MD 20742


If the following is a joke, I am very sorry for wasting the bandwidth.
I thought that it looked reputable enough to repeat. I can't vouch
for the validity of the article, so please DO NOT SEND ME MAIL ASKING
QUESTIONS. I WILL IGNORE THE MAIL. This was posted in our local cs
newsgroup. That's all I know.

Gary Flake


Article 4678 of cs.grad:
From: eanv20@castle.ed.ac.uk (John Woods)
Newsgroups: comp.theory
Subject: Re: binomial simulation
Date: 8 Apr 92 08:42:45 GMT
Distribution: comp
Organization: Edinburgh University

I wrote:
	Is there an algorithm to simulate a binomial random variable 
	B(n,p) using fewer than O(n) random numbers (as required by
	the naive, coin-tossing algorithm)?

Eric wrote
	The method given in Numerical Recipes uses coin-tossing for n<25, a  
	Poisson approximation if np<1, and rejection otherwise. It's faster  
	than anything I could write (though I could speed it up a little more  
	for special purposes), but still nowhere near 1e6 deviates/second. 

How did I miss this?  The cumulative binomial function I was using was
from the same source! <shame> Thanks for pointing it out, anyway.  I
don't need 1e6 _deviates_ per second - just 1 will do --- it's 1e6
naive coin tosses a second I needed!

				...Cheers...


-- 
 /******* cut here ******* John Woods ******* cut here ********
 * Philosophy: Forsan et haec olim meminisse iuvabit (Virgil) *
 * Disclaimer: Every statement in this file is possibly !true *
 ******** cut here ******* John Woods ******* cut here *******/
From: chien@ece.arizona.edu (Lien-Pharn Chien)
Newsgroups: comp.theory
Subject: How does a fuzzy number compare to 0 ?
Keywords: Fuzzy number (Fuzzy set)
Date: 16 Apr 92 04:37:13 GMT
Reply-To: chien@ece.arizona.edu (Lien-Pharn Chien)
Distribution: world,local
Organization: University of Arizona Dept. of Electrical and Computer Engineering


Hi, 

   Assume a fuzzy number (fuzzy set), N = (a, b, c, d),
   where a, b, c & d are the points from left to right.
   
   Does anyone tell me what is the requirement of,

        N > 0  or  N < 0.   

   I couldn't find out a suitable news group to post my
   question. Hopefully, this group is ok.

   Thanks in advance.

Chien.
 
Newsgroups: comp.theory
From: minch@lotka.stanford.edu (Eric Minch)
Subject: Re: binomial simulation
Organization: Stanford University, California, USA
Distribution: comp
Date: Tue, 7 Apr 1992 18:02:04 GMT

John Woods writes
<munch>
> Is there an algorithm to simulate a binomial random variable 
> B(n,p) using fewer than O(n) random numbers (as required by
> the naive, coin-tossing algorithm)?
> 
> 		[Thanks to Gene Ressler]
> 
> So far I've attempted to do it by generating a single random variable
> and interpolating it onto the cumulative binomial.  The interpolation
> method I used was simple interval halving (I don't know the  
derivative
> of the Cum. Bin. function, so I couldn't use Newton-Raphson).  But
> even this gross approach seemed to surpass the coin tossing algorithm
> at around n=100000.
> 
> 				...John Woods
> 
The method given in Numerical Recipes uses coin-tossing for n<25, a  
Poisson approximation if np<1, and rejection otherwise. It's faster  
than anything I could write (though I could speed it up a little more  
for special purposes), but still nowhere near 1e6 deviates/second. 

Eric Minch             Any resemblance to the opinions of persons
Epistemic Artisan      or organizations other than myself--living,
Stanford Genetics      dead, or imaginary--is purely fortuitous.
From: dstearns@polyslo.csc.calpoly.edu (Dan Stearns)
Newsgroups: comp.theory
Subject: Fredman/Willard n log n / log log n sort
Date: 17 Apr 92 00:53:42 GMT
Distribution: usa
Organization: Cal Poly State Univ,CSC Dept,San Luis Obispo,CA 93407


An article in Information Week (an MIS trade rag) of 10/21/91
discussed a new sort algorithm developed by Fredman of UCSD and
Willard of SUNY-Albany.   There is no reference to any published
article mentioned.

Does anyone know of this work and have a reference to a published
journal article?

Dan Stearns
Associate Prof
Cal Poly State University
From: ddailey@williams.edu
Newsgroups: comp.theory
Subject: Re: References on Geometric Graphs?
Date: 13 Apr 92 15:30:55 GMT
Article-I.D.: williams.1992Apr13.153055.21445
Reply-To: ddailey@williams.edu
Distribution: usa
Organization: williams college

In article <2493@creatures.cs.vt.edu> lavinus@csgrad.cs.vt.edu (Joseph Lavinus)
writes:
>Hello!
>
>I'm looking for references to graphs which [JAMS89] refers to as "geometric
>graphs".  These are a type of random graphs; the graph $U_{n,d}$ is generated
>in the following way:
>
>   For each of the $n$ vertices, assign $x$ and $y$ coordinates chosen from
>      a uniform random distribution over the interval (0,1)
>
>   In the graph, there exists an edge between two vertices if the Euclidean
>      distance between the assigned points is less than $d$.
>
>[JAMS89] cites no reference for these, but I find it difficult to believe that
>they were invented in 1989.  If anyone knows of any references to graphs
>similar to what I just described, please let me know.  I'll summarize if there
>is a demand.
>
Though I didn't call them "geometric graphs" my doctoral dissertation (U of
Colorado, 1978) did utilize just such a technique for generating some random
graphs against which to test a set of chromatic approximation algorithms.
Interestingly, I found that the relative performance of these heuristics
changed as a function of the type of random graphs employed (e.g., fill the
adjacency matrix randomly with each edge having probability p, vs. the above
technique).

David Dailey