Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Tight Bounds for Linkages in Planar Graphs
 

Summary: Tight Bounds for Linkages
in Planar Graphs
Isolde Adler1
Stavros G. Kolliopoulos2
Philipp Klaus Krause1
Daniel Lokshtanov3
Saket Saurabh4
Dimitrios Thilikos2
1
Goethe-Universit¨at, Frankfurt am Main
2
National and Kapodistrian University of Athens
3
University of California, San Diego
4
Institute of Mathematical Sciences, Chennai
Abstract. The Disjoint-Paths Problem asks, given a graph G and
a set of pairs of terminals (s1, t1), . . . , (sk, tk), whether there is a collec-
tion of k pairwise vertex-disjoint paths linking si and ti, for i = 1, . . . , k.
In their f(k) · n3

  

Source: Adler, Isolde - Institut für Informatik, Johann Wolfgang Goethe-Universität Frankfurt am Main
Dimitrios, Thilikos - Department of Mathematics, University of Athens
Kolliopoulos, Stavros - Department of Informatics and Telecommunications, University of Athens

 

Collections: Computer Technologies and Information Sciences; Mathematics