Campus Event Calendar
Event Entry
What and Who
A very practical algorithm for the two-paths problem in 3-connected planar graphs
Torben Hagerup
Max-Planck-Institut für Informatik - D1
AG1 Mittagsseminar (own work)
AG 1, AG 3, AG 5, RG2, AG 2, AG 4, RG1, SWS
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 27 February 2007
13:30
30 Minutes
E1 4
024
Saarbrücken
Abstract
A linear-time algorithm that does not need a
planar embedding is presented for the problem
of computing two vertex-disjoint paths, each with
prescribed endpoints, in an undirected 3-connected
planar graph.
Contact
Khaled Elbassioni
--email hidden
passcode not visible
logged in users only
Khaled Elbassioni, 02/26/2007 13:28 -- Created document.