Campus Event Calendar
Event Entry
What and Who
Representing planar embeddings of 2-connected graphs as integer linear programs
Rene Weiskircher
Seminar des Graduiertenkollegs
AG 1, AG 2
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Monday, 19 January 98
16:00
60 Minutes
45 - FB14
015
Saarbrücken
Abstract
A graph is planar, when it can be drawn on the plane in such a way that no two edges of the graph cross each other. A planar embedding of such a graph gives the sequence of the edges connected to each node in clockwise or anti-clockwise order for a planar drawing of the graph. An equivalent way of describing a planar embedding of a 2-connected planar graph is the list of the circles in the graph that bound a region in the planar drawing. In this talk, we want to show how we can represent the set of all possible planar embeddings of a biconnected graph as a linear program.
Contact
Uelkue Coruh
--email hidden
passcode not visible
logged in users only