Visualization of graphs using their product structure

author: Janez Žerovnik, University of Maribor
published: Feb. 25, 2007,   recorded: November 2005,   views: 5238


Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


Graphs are combinatorial structures given by a set of vertices and a set of edges giving the adjacencies between pairs of vertices. Drawing graphs nicely is a challenging task. If a graph has some particular structure it is often very useful to use the knowledge about this for visualizing the object. In many cases, there are polynomial time algorithms for recognition of product graphs and graph bundles. We provide several examples and give a short survey of results and open problems.

See Also:

Download slides icon Download slides: cov05_zerovnik_vgutp_01.ppt (836.0 KB)

Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: