Campus Event Calendar
Event Entry
What and Who
On Orientations and Connectivity of Planar Graphs
Hubert de Fraysseix
CNRS-EHESS Paris
AG1 Mittagsseminar
AG 1, AG 2
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Wednesday, 22 July 98
13:30
40 min.
46.1
024
Saarbrücken
Abstract
We shall primarily be concerned by constrained orientations
and relate them to tree-decompositions, bipolar orientations,
etc.
We shall deduce two simple linear time algorithms:
-- checking whether a plane graph is 3-connected
-- checking whether a maximal plane graph is 4-connected.
Contact
Petra Mutzel
9325 105
--email hidden
passcode not visible
logged in users only
Tags, Category, Keywords and additional notes
Graph Theory; Orientations; Graph Algorithms