Presentation is loading. Please wait.

Presentation is loading. Please wait.

2005/3/1 Efficient Algorithms for the Longest Path Problem Ryuhei UEHARA (JAIST) Yushi UNO (Osaka.

Published byLillian Williamson Modified over 8 years ago

Similar presentations

Presentation on theme: "2005/3/1 Efficient Algorithms for the Longest Path Problem Ryuhei UEHARA (JAIST) Yushi UNO (Osaka."— Presentation transcript:

1 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf Efficient Algorithms for the Longest Path Problem Ryuhei UEHARA (JAIST) Yushi UNO (Osaka Prefecture University)

2 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf The Longest Path Problem Finding a longest (vertex disjoint) path in a given graph Motivation (comparing to Hamiltonian path): … Approx. Algorithm, Parameterized Complexity … More practical/natural … More difficult(?)

3 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf The Longest Path Problem Known (hardness) results; We cannot find a path of length n-n ε in a given Hamiltonian graph in poly-time unless P=NP [Karger, Motwani, Ramkumar; 1997] We can find O(log n) length path [Alon, Yuster, Zwick;1995] ( ⇒ O((log n/loglog n) 2 ) [Björklund, Husfeldt; 2003]) Approx. Alg. achieves O(n/log n) [AYZ95] ( ⇒ O(n(loglog n/log n) 2 )[BH03]) Exponential algorithm [Monien 1985]

4 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf The Longest Path Problem Known polynomial time algorithm ;  Dijkstra’s Alg.(196?) ： Linear alg. for finding a longest path in a tree;

5 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf The Longest Path Problem Known polynomial time algorithm ;  Dijkstra’s Alg.(196?) ： Linear alg. for finding a longest path in a tree;

6 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf The Longest Path Problem Known polynomial time algorithm ;  Dijkstra’s Alg.(196?) ： Linear alg. for finding a longest path in a tree;

7 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf The Longest Path Problem Known polynomial time algorithm ;  Dijkstra’s Alg.(196?) ： Linear alg. for finding a longest path in a tree;

8 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf Approaches to the Efficient Algs to Longest Path Problem 1. Extension of the Dijkstra’s algorithm  Weighted trees (linear), block graphs (linear), cacti (O(n 2 )). 2. Graph classes s.t. Hamiltonian Path can be found in poly time  Some graph classes having interval representations (bipartite permutation, interval biconvex graphs) 3. Dynamic programming to the graph classes that have tree representations (on going)  Cacti(linear), … (ISAAC 2004)

9 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf Approaches to the Efficient Algs to Longest Path Problem 1. Extension of the Dijkstra’s algorithm  Weighted trees (linear), block graphs (linear), cacti (O(n 2 )). 2. Graph classes s.t. Hamiltonian Path can be found in poly time  Some graph classes having interval representations (bipartite permutation, interval biconvex graphs) 3. Dynamic programming to the graph classes that have tree representations (on going)  Cacti(linear), … (ISAAC 2004)

10 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf 1. Ex of Dijkstra’s Alg Bulterman et.al. (IPL,2002) showed that the correctness of Dijkstra’s alg stands for; 1. For each u,v, length of the shortest path between u and v = length of the longest path between u and v 2. For each u,v,w, d(u,v) ≦ d(u,w) + d(w,v) 3. For each u,v,w, d(u,v) ＝ d(u,w) + d(w,v) if and only if w is on the unique path between u and v

11 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf 1. Ex of Dijkstra’s Alg Construct G’=(V’,E’) from G=(V,E) s.t. ：  V ⊆ V’  For each u,v ∈ V, length of the shortest path between u,v on G’ = length of the longest path between u,v on G  For each u,v ∈ V, the shortest path between u,v on G’ is unique

12 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf 1. Ex of Dijkstra’s Alg Theorem: ExDijkstra finds a longest path if G and G’ satisfy the conditions. ExDijkstra: G=(V,E) and G’=(V’,E’) 1. pick any vertex w in V; 2. find x ∈ V with max{d(w,x)} on G’; 3. find y ∈ V with max{d(x,y)} on G’; 4. x and y are the endpoints of the longest path in G, and d(x,y) on G’ is its length.

13 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf 1. Ex of Dijkstra’s Alg (Summary) Theorem: Vertex/edge weighted tree (linear) Theorem: Block graph (O(|V|+|E|)) Theorem: Cactus (O(|V| 2 ))

14 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf 1. Ex of Dijkstra’s Alg (Cacti) Cactus: Each block is a cycle Two cycle share at most one vertex which is a separator The longest path between u and v on G cactus G’G’G The shortest path between u and v on G’ =

15 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf 1. Ex of Dijkstra’s Alg (Cacti) Sample

16 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf 1. Ex of Dijkstra’s Alg (Cacti) Sample

17 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf 1. Ex of Dijkstra’s Alg (Cacti) Sample

18 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf 1. Ex of Dijkstra’s Alg (Cacti) Sample

19 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf 1. Ex of Dijkstra’s Alg (Cacti) Sample

20 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf 1. Ex of Dijkstra’s Alg (Cacti) Sample

21 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf 1. Ex of Dijkstra’s Alg (Cacti) Sample

22 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf Graph classes s.t. Hamiltonian Path can be found in poly time Fact 1: Hamiltonian Path is NP-hard on a chordal graph. (In fact, strongly chordal split graph[Müller,1997].) Fact 2: Hamiltonian Path is solvable on an interval graph in linear time. [Damaschke, 1993]. Our goal: Poly-time algorithm for Longest Path on an interval graph.

23 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf Interval Graphs An interval graph G=(V,E) has an interval representation s.t. {u,v} ∈ E iff I u ∩I v ≠φ

24 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf Interval Graphs An interval graph G=(V,E) has an interval representation s.t. {u,v} ∈ E iff I u ∩I v ≠φ u v IuIu IvIv Hamiltonian Path: linear time solvable. Longest Path: ???? ⇒ Restricted interval graphs…

25 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf Restricted Interval Graphs An interval biconvex graph G=(S ∪ Y,E) has an interval representation s.t… Y: biconvex S: integer points s1s1 s2s2 s4s4 s3s3 s5s5 s6s6 s7s7 s8s8

26 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf Restricted Interval Graphs Interval biconvex graph G=(S ∪ Y,E) is introduced [Uehara, Uno; 2004] from graph theoretical viewpoints; Natural analogy of biconvex graphs (bipartite graph class) Generalization of proper interval graphs Generalization of threshold graphs Best possible class longest path can be found in poly time…

27 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf Poly-time alg for longest path on an interval biconvex graph (idea)  Find the trivial longest path P on G[Y];  Embed the vertices in S into P as possible;  Adjust endpoints if necessary. 343719238830

28 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf Poly-time alg for longest path on an interval biconvex graph (idea)  Find the trivial longest path P on G[Y];  Embed the vertices in S into P as possible;  Adjust endpoints if necessary. 343719238830

29 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf 30 Poly-time alg for longest path on an interval biconvex graph (idea)  Find the trivial longest path P on G[Y];  Embed the vertices in S into P as possible;  Adjust endpoints if necessary. 3437192388 3 4 7 9 8 8

30 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf 30 Poly-time alg for longest path on an interval biconvex graph (idea)  Find the trivial longest path P on G[Y];  Embed the vertices in S into P as possible;  Adjust endpoints if necessary. 3437192388 3 4 7 9 8 30

31 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf 30 Poly-time alg for longest path on an interval biconvex graph (idea)  Find the trivial longest path P on G[Y];  Embed the vertices in S into P as possible;  Adjust endpoints if necessary. 3437192388 3 4 7 9 8 30 How can we determine the vertices in S? Where do we embed them?

32 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf 30 Poly-time alg for longest path on an interval biconvex graph (idea)  Embed the vertices in S into P as possible; 3437192388 30 8 3 4 3 7 1 9 2 3 8 w(e) is the number at the right-endpoint

33 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf 30 Poly-time alg for longest path on an interval biconvex graph (idea)  Embed the vertices in S into P as possible; 3437192388 30 8 3 4 3 7 1 9 2 3 8 w(e) is the number at the right-endpoint Find the maximum weighted matching!!

34 2005/3/1 NHC@Kyoto http://www.jaist.ac.jp/~uehara/ps/longest.pdf Open Problems Longest Path on an interval graph??  Combination of DP/Dijkstra and weighted maximum matching on MPQ-tree representation?  Related to the following open problem? Hamiltonian Path with a start point on an interval graph? [Damaschke, 1993]. Extension to  Longest cycle on some graph classes  Hamiltonian cycle/path on some graph classes

Download ppt "2005/3/1 Efficient Algorithms for the Longest Path Problem Ryuhei UEHARA (JAIST) Yushi UNO (Osaka."

Similar presentations

Lecture 24 Coping with NPC and Unsolvable problems. When a problem is unsolvable, that's generally very bad news: it means there is no general algorithm.

Lecture 24 Coping with NPC and Unsolvable problems. When a problem is unsolvable, that's generally very bad news: it means there is no general algorithm.
What is Intractable? Some problems seem too hard to solve efficiently. Question 1: Does an efficient algorithm exist?  An O(a ) algorithm, where a > 1,

What is Intractable? Some problems seem too hard to solve efficiently. Question 1: Does an efficient algorithm exist?  An O(a ) algorithm, where a > 1,
1 NP-completeness Lecture 2: Jan 11. 2 P The class of problems that can be solved in polynomial time. e.g. gcd, shortest path, prime, etc. There are many.

1 NP-completeness Lecture 2: Jan P The class of problems that can be solved in polynomial time. e.g. gcd, shortest path, prime, etc. There are many.
1 Review of some graph algorithms Graph G(V,E) (Chapter 22) –Directed, undirected –Representation Adjacency-list, adjacency-matrix Breadth-first search.

1 Review of some graph algorithms Graph G(V,E) (Chapter 22) –Directed, undirected –Representation Adjacency-list, adjacency-matrix Breadth-first search.
Tree Spanners for Bipartite Graphs and Probe Interval Graphs Andreas Brandstädt 1, Feodor Dragan 2, Oanh Le 1, Van Bang Le 1, and Ryuhei Uehara 3 1 Universität.

Tree Spanners for Bipartite Graphs and Probe Interval Graphs Andreas Brandstädt 1, Feodor Dragan 2, Oanh Le 1, Van Bang Le 1, and Ryuhei Uehara 3 1 Universität.
Toshiki Saitoh ERATO, Minato Project, JST Subgraph Isomorphism in Graph Classes Joint work with Yota Otachi, Shuji Kijima, and Takeaki Uno The 14 th Korea-Japan.

Toshiki Saitoh ERATO, Minato Project, JST Subgraph Isomorphism in Graph Classes Joint work with Yota Otachi, Shuji Kijima, and Takeaki Uno The 14 th Korea-Japan.
Reconstruction Algorithm for Permutation Graphs Masashi Kiyomi, Toshiki Saitoh, and Ryuhei Uehara School of Information Science Japan Advanced Institute.

Reconstruction Algorithm for Permutation Graphs Masashi Kiyomi, Toshiki Saitoh, and Ryuhei Uehara School of Information Science Japan Advanced Institute.
1 Optimization problems such as MAXSAT, MIN NODE COVER, MAX INDEPENDENT SET, MAX CLIQUE, MIN SET COVER, TSP, KNAPSACK, BINPACKING do not have a polynomial.

1 Optimization problems such as MAXSAT, MIN NODE COVER, MAX INDEPENDENT SET, MAX CLIQUE, MIN SET COVER, TSP, KNAPSACK, BINPACKING do not have a polynomial.
Collective Additive Tree Spanners of Homogeneously Orderable Graphs

Collective Additive Tree Spanners of Homogeneously Orderable Graphs
Collective Tree Spanners of Graphs with Bounded Parameters F.F. Dragan and C. Yan Kent State University, USA.

Collective Tree Spanners of Graphs with Bounded Parameters F.F. Dragan and C. Yan Kent State University, USA.
CSE 421 Algorithms Richard Anderson Lecture 27 NP Completeness.

CSE 421 Algorithms Richard Anderson Lecture 27 NP Completeness.
Collective Tree Spanners of Graphs F.F. Dragan, C. Yan, I. Lomonosov Kent State University, USA Hiram College, USA.

Collective Tree Spanners of Graphs F.F. Dragan, C. Yan, I. Lomonosov Kent State University, USA Hiram College, USA.
Collective Tree Spanners and Routing in AT-free Related Graphs F.F. Dragan, C. Yan, D. Corneil Kent State University University of Toronto.

Collective Tree Spanners and Routing in AT-free Related Graphs F.F. Dragan, C. Yan, D. Corneil Kent State University University of Toronto.
All-Pairs Shortest Paths

All-Pairs Shortest Paths
Approximation Algorithms Motivation and Definitions TSP Vertex Cover Scheduling.

Approximation Algorithms Motivation and Definitions TSP Vertex Cover Scheduling.
Hardness Results for Problems

Hardness Results for Problems
GRAPH Learning Outcomes Students should be able to:

GRAPH Learning Outcomes Students should be able to:
Distance Approximating Trees in Graphs

Distance Approximating Trees in Graphs
Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 1.

Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 1.
All-Pairs Bottleneck Paths in Vertex Weighted graphs Asaf Shapira Microsoft Research Raphael Yuster University of Haifa Uri Zwick Tel-Aviv University.

All-Pairs Bottleneck Paths in Vertex Weighted graphs Asaf Shapira Microsoft Research Raphael Yuster University of Haifa Uri Zwick Tel-Aviv University.

Similar presentations

Ads by Google