GD 2000

GD2000: Graph Drawing Contest

Graph B

Contributed by Ulrik Brandes, University of Konstanz.


Disclaimer: This is a real-world task on real-world data. However, all references to entities in the real world have been anonymized to keep their privacy. We are grateful to Maryann M. Durland, who is working as an independent business consultant, for posing the problem.

A large organization asked for an evaluation of its project teams. The teams in this organization are to channel information from internal experts (resources) to customers (clients). Both have been trained to work with clients and resources following a specific model. Data on the contact structure was gathered as a potential indicator of team performance.

The two particular teams below were selected for this contest, because a significant difference in their structure of contacts within the team, and with clients and resources, is to be expected.


You should produce one or more graph drawings that depict the teams' structures and thus enable a comparison of the two teams with respect to their duties.


To gather the data, each member of a given team was presented a list with the names of their team members. Each team member was also asked to list both the clients and the experts they had contact with. The team members were asked to indicate the frequency of contact with each of the other individuals on the following scale:

	0	no contact
	1	weekly
	2	biweekly
	3	monthly
	4	quarterly

Both data sets are thus given as a directed graph with edge weights ranging from 1 to 4, corresponding to the frequency of contact. Vertices are colored green (team), blue (resource), or yellow (client). Note that you are not obliged, e.g., to represent clients and resources as vertices, or to use labels and colors for frequency and status, respectively.

Team A: adjacency matrix in ASCII format / graph in LEDA's gw format / graph in GML format
Team A

Team B: adjacency matrix in ASCII format / graph in LEDA's gw format / graph in GML format
Team B