University of Essen / Institute for Experimental Mathematics / Computer Networking Technology Group / Thomas Dreibholz

Generating Random Graphs
Implementations to my 1998 seminar talk

News

• 06-Oct-00: This page has been created.

Description

These programs are the implementation to my seminar talk "Generierung zufälliger Graphen" (Generating Random Graphs), based on the paper Nicholas C. Wormald, "Generating Random Regular Graphs" An application for random graphs are testing and verificating graph algorithms; for example checking some properties of a graph like being connected, 2-connected, n-connected, etc..

• BiPart
  Generarion of random bipartite graphs.

• RandCubic
  Generarion of random cubic graphs (all vertices have degree 3).

• RandGraph
  Generarion of random graphs.

• BOPs
  Generarion of BOPS (bi-connected, planar graphs).

• MOPs
  Generarion of MOPS (BOPs having maximum number of edges).

• GraphViewer
  This is a Qt/KDE-based Linux program to display and print the generated graphs. It also supports saving to PostScript files, Drag and Drop, multiple windows, ... . An English locale is included, too.

Project members

• Thomas Dreibholz
• Gil-Joo Park

Screenshots

Click here to view some screenshots!

Documentation

• List of all files
• List of all globals
• Class hierarchy

Download

• Download (Tar/GZip)

Requirements

• Linux or another Unix system
• Qt 1.44
• KDE 1.0 or better

Useful Links

• Homepage of Fritz-Eduard Peters
• Qt's homepage
• KDE's homepage

28.01.2011 Thomas Dreibholz, University of Essen / Institute for Experimental Mathematics / Computer Networking Technology Group