a faster parameterized algorithm for treedepth
play

A Faster Parameterized Algorithm for Treedepth Felix Reidl, Peter - PowerPoint PPT Presentation

May 18, 2023 •48 likes •768 views

A Faster Parameterized Algorithm for Treedepth Felix Reidl, Peter Rossmanith, Fernando S anchez Villaamil Somnath Sikdar RWTH Aachen University July 11, 2014 Fernando S anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July

  1. A Faster Parameterized Algorithm for Treedepth Felix Reidl, Peter Rossmanith, Fernando S´ anchez Villaamil Somnath Sikdar RWTH Aachen University July 11, 2014 Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 1 / 51

  2. Treedepth Treedepth is a width measure. Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 2 / 51

  3. Treedepth Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 3 / 51

  4. Treedepth Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 3 / 51

  5. Treedepth Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 3 / 51

  6. Treedepth 5 3 2 1 6 7 4 8 Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 4 / 51

  7. Treedepth 5 3 1 2 1 2 3 4 6 7 6 5 7 8 4 8 Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 4 / 51

  8. Treedepth 5 3 1 2 1 2 3 4 6 7 6 5 7 8 4 8 Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 4 / 51

  9. Treedepth Definition (Treedepth decomposition) A treedepth decomposition of a graph G is a rooted forest F such that V ( G ) ⊆ V ( F ) and E ( G ) ⊆ E ( clos ( F )). Definition (Treedepth) The treedepth td ( G ) of a graph G is the minimum height of any treedepth decomposition of G . Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 5 / 51

  10. Treedepth A strange width measure... “So many choices” —Dr. Dre A graph G has treedepth at most t if G is a subgraph the closure of a tree (forest) of height ≤ t G has a centered coloring with t colors G has a ranked coloring with t colors G is the subgraph of a trivially perfect graph with clique size ≤ t Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 6 / 51

  11. Treedepth Centered Coloring Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 7 / 51

  12. Treedepth Centered Coloring Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 8 / 51

  13. Treedepth Centered Coloring Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 8 / 51

  14. Treedepth Ranked Coloring 5 1 1 4 2 2 3 1 1 Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 9 / 51

  15. Treedepth Ranked Coloring 5 1 1 5 4 4 2 2 2 3 2 3 1 1 1 1 1 1 Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 9 / 51

  16. Treedepth Trivially Perfect Graphs G is the subgraph of a trivially perfect graph with clique size at most t . Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 10 / 51

  17. Treedepth Trivially Perfect Graphs G is the subgraph of a trivially perfect graph with clique size at most t . Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 10 / 51

  18. Treedepth Arises again and again Introduced as... minimum elimination tree by Pothen [1988] ordered coloring by Katchalski et al. [1995] vertex ranking by Bodlaender et al. [1998] again as treedepth by Neˇ setˇ ril and Ossona de Mendez [2008] Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 11 / 51

  19. Treedepth Arises again and again Introduced as... minimum elimination tree by Pothen [1988] ordered coloring by Katchalski et al. [1995] vertex ranking by Bodlaender et al. [1998] again as treedepth by Neˇ setˇ ril and Ossona de Mendez [2008] Related to... layouting of VLSI chips star height of regular languages characterizing bounded expansion graph classes counting subgraphs [New results coming] Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 11 / 51

  20. Treedepth Arises again and again Introduced as... minimum elimination tree by Pothen [1988] ordered coloring by Katchalski et al. [1995] vertex ranking by Bodlaender et al. [1998] again as treedepth by Neˇ setˇ ril and Ossona de Mendez [2008] Related to... layouting of VLSI chips star height of regular languages characterizing bounded expansion graph classes counting subgraphs [New results coming] Personal opinion : Treedepth is the most useful definition. Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 11 / 51

  21. Treedepth 4 1 2 3 4 3 5 6 5 7 1 2 7 6 Treedepth t → Maximal path length 2 t − 1. Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 12 / 51

  22. Treedepth Treedepth t → Maximal path length 2 t − 1. Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 13 / 51

  23. Treedepth Treedepth t → Maximal path length 2 t − 1. Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 13 / 51

  24. Treedepth Basic results A DFS is a Treedepth decomposition Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 14 / 51

  25. Treedepth Basic results A DFS is a Treedepth decomposition Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 14 / 51

  26. Treedepth Basic results A DFS is a Treedepth decomposition Treedepth t ⇒ Maximal path length 2 t − 1 ⇒ 2 t -approximation Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 14 / 51

  27. Treedepth Basic results Treedepth to pathwidth Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 15 / 51

  28. Treedepth Basic results Treedepth to pathwidth Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 15 / 51

  29. Treedepth Basic results Treedepth to pathwidth Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 15 / 51

  30. Treedepth Basic results Treedepth to pathwidth Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 15 / 51

  31. Treedepth Basic results Treedepth to pathwidth Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 15 / 51

  32. Treedepth Basic results Treedepth to pathwidth Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 15 / 51

  33. Treedepth Basic results Treedepth to pathwidth Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 15 / 51

  34. Treedepth Basic results Treedepth to pathwidth Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 15 / 51

  35. Treedepth Basic results Treedepth to pathwidth Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 15 / 51

  36. Treedepth Basic results Treedepth to pathwidth Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 15 / 51

  37. Treedepth Basic results Treedepth to pathwidth tw ( G ) ≤ pw ( G ) ≤ td ( G ) − 1 Treedepth t ⇒ Path decomposition of width 2 t − 2 Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 15 / 51

  38. Treedepth Basic results Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 16 / 51

  39. Treedepth Basic results Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 16 / 51

  40. Treedepth Basic results Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 16 / 51

  41. Treedepth Basic results Treedepth by bruteforce G Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 17 / 51

  42. Treedepth Basic results Treedepth by bruteforce G S Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 17 / 51

  43. Treedepth Basic results Treedepth by bruteforce S Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 17 / 51

  44. Treedepth Basic results Treedepth by bruteforce Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 17 / 51

  45. Treedepth Basic results Treedepth by bruteforce Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 17 / 51

  46. Treedepth Basic results Parameterized algorithms Open problem by Neˇ setˇ ril and Ossona de Mendez [2012] Is there a simple linear time algorithm to check td ( G ) ≤ t for fixed t ? Fernando S´ anchez Villaamil (RWTH) Parameterized Algorithm for Treedepth July 11, 2014 18 / 51

Recommend

A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth

A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth

A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth Friedrich Slivovsky and Stefan Szeider 1 Propositional Model Counting (#SAT) 2 Propositional Model Counting (#SAT) SAT Does have a satisfying

1.31k views • 102 slides
A Parameterized Algorithm for Upward Planarity Testing of Biconnected Graphs Masters thesis

A Parameterized Algorithm for Upward Planarity Testing of Biconnected Graphs Masters thesis

A Parameterized Algorithm for Upward Planarity Testing of Biconnected Graphs Masters thesis presentation Hubert Chan University of Waterloo May 6, 2003 p. 1/48 Graph drawing goal: visualization of graph structures vertices

1.08k views • 69 slides
Deterministic parameterized connected vertex cover Marek Cygan IDSIA, University of Lugano,

Deterministic parameterized connected vertex cover Marek Cygan IDSIA, University of Lugano,

Deterministic parameterized connected vertex cover Marek Cygan IDSIA, University of Lugano, Switzerland July 4, Helsinki, SWAT 2012 Marek Cygan Deterministic parameterized CVC 1/21 Outline Introduction. 1 Our algorithm. 2 Time

417 views • 40 slides
Towards Faster Nonnegative Tensor Factorization: A New Active-Set type Algorithm and Comparisons

Towards Faster Nonnegative Tensor Factorization: A New Active-Set type Algorithm and Comparisons

Towards Faster Nonnegative Tensor Factorization: A New Active-Set type Algorithm and Comparisons Haesun Park hpark@cc.gatech.edu College of Computing Georgia Institute of Technology Atlanta, GA 30332, USA Joint work with Krishnakumar

502 views • 24 slides
algorithm of Savage and JaJa [SJ81] uses O(log n) (resp. O((log - Implementation 2 is faster

algorithm of Savage and JaJa [SJ81] uses O(log n) (resp. O((log - Implementation 2 is faster

SIAM J. COMPUT. 1985 Society for Industrial and Applied Mathematics Vol. 14, No. 4, November 1985 007 AN EFFICIENT PARALLEL BICONNECTIVITY ALGORITHM* ROBERT E. TARJAN AND UZI VISHKIN:I: Abstract. In this paper we propose a new algorithm for

701 views • 13 slides
Decentralize and Randomize: Faster Algorithm for Wasserstein Barycenters Pavel Dvurechensky,

Decentralize and Randomize: Faster Algorithm for Wasserstein Barycenters Pavel Dvurechensky,

Decentralize and Randomize: Faster Algorithm for Wasserstein Barycenters Pavel Dvurechensky, Darina Dvinskikh, Alexander Gasnikov, Csar A. Uribe, Angelia Nedi c Conference on Neural Information Processing Systems 2018 Wasserstein

391 views • 9 slides
Yet a Faster Motion Estimation Algorithm with Directional Search Strategies Speaker: Prof. W.C.

Yet a Faster Motion Estimation Algorithm with Directional Search Strategies Speaker: Prof. W.C.

15 th International Conference on Digital Signal Processing (DSP2007), July 2007, Cardiff, UK. Yet a Faster Motion Estimation Algorithm with Directional Search Strategies Speaker: Prof. W.C. Siu Ying Zhang+*, Wan-Chi Siu* and Tingzhi Shen+*

348 views • 12 slides
Optimising the SHA256 Hashing Algorithm for Faster and More Efficient Bitcoin Mining Presented

Optimising the SHA256 Hashing Algorithm for Faster and More Efficient Bitcoin Mining Presented

Optimising the SHA256 Hashing Algorithm for Faster and More Efficient Bitcoin Mining Presented by: Rahul P. Naik (12026189) Supervisor: Dr. Nicolas T. Courtois MSc Information Security DEPARTMENT OF COMPUTER SCIENCE September 17, 2013

579 views • 33 slides
Algorithms for Computing the Longest Parameterized Common Subsequence Costas S. Iliopoulos 1 ,

Algorithms for Computing the Longest Parameterized Common Subsequence Costas S. Iliopoulos 1 ,

Algorithms for Computing the Longest Parameterized Common Subsequence Costas S. Iliopoulos 1 , Marcin Kubica 2 , M. Sohel Rahman 1 and Tomasz Wale 2 1 Algorithm Design Group Department of Computer Science, Kings College London 2 Faculty of

455 views • 32 slides
Faster algorithms for the characteristic polynomial Clment P ERNET and Arne S TORJOHANN

Faster algorithms for the characteristic polynomial Clment P ERNET and Arne S TORJOHANN

State of the art A new algorithm The new algorithm into practice Faster algorithms for the characteristic polynomial Clment P ERNET and Arne S TORJOHANN Symbolic Computation Group University of Waterloo, Canada. ISSAC 2007, Waterloo, July

935 views • 61 slides
Generating random primes faster The standard algorithm to generate random primes: D. J.

Generating random primes faster The standard algorithm to generate random primes: D. J.

1 2 Generating random primes faster The standard algorithm to generate random primes: D. J. Bernstein proof.arithmetic(False) while True: pqRSA project team: p = randrange(2^(n-1),2^n) Daniel J. Bernstein p = ZZ(p) Josh Fried if

826 views • 14 slides
A Faster Convex-Hull Algorithm via Bucketing Ask Neve Gamby 1 Jyrki Katajainen 2 , 3 1 National

A Faster Convex-Hull Algorithm via Bucketing Ask Neve Gamby 1 Jyrki Katajainen 2 , 3 1 National

Introduction Bucketing Competitors Experiments Reflections A Faster Convex-Hull Algorithm via Bucketing Ask Neve Gamby 1 Jyrki Katajainen 2 , 3 1 National Space Institute Technical University of Denmark 2 Department of Computer Science

363 views • 15 slides
Parameterized Complexity of Integer Linear Programming (ILP) Sebastian Ordyniak Parameterized

Parameterized Complexity of Integer Linear Programming (ILP) Sebastian Ordyniak Parameterized

Parameterized Complexity of Integer Linear Programming (ILP) Sebastian Ordyniak Parameterized Graph Algorithms & Data Reduction (Shonan Meeting 144, 2019) 1 / 62 Integer Linear Programming (ILP) archetypical problem for NP -complete

1.25k views • 88 slides
A Faster Algorithm for Finding Minimum Tucker Submatrices Guillaume Blin Romeo Rizzi St

A Faster Algorithm for Finding Minimum Tucker Submatrices Guillaume Blin Romeo Rizzi St

A Faster Algorithm for Finding Minimum Tucker Submatrices Guillaume Blin Romeo Rizzi St ephane Vialette LIGM Universit e Paris-Est Marne-la-Vall ee, France DIMI Universit degli Studi di Udine, Italy. June 2010 Consecutive ones

471 views • 26 slides
A Generic Quasi-Newton Algorithm for Faster Gradient-Based Optimization Hongzhou Lin 1 , Julien

A Generic Quasi-Newton Algorithm for Faster Gradient-Based Optimization Hongzhou Lin 1 , Julien

A Generic Quasi-Newton Algorithm for Faster Gradient-Based Optimization Hongzhou Lin 1 , Julien Mairal 1 , Zaid Harchaoui 2 1 Inria, Grenoble 2 University of Washington LCCC Workshop on large-scale and distributed optimization Lund, 2017 Julien

1.07k views • 61 slides
Parameterized graph separation problems D aniel Marx Budapest University of Technology and

Parameterized graph separation problems D aniel Marx Budapest University of Technology and

Parameterized graph separation problems D aniel Marx Budapest University of Technology and Economics dmarx@cs.bme.hu International Workshop on Parameterized and Exact Computation September 14, 2004 Bergen, Norway Parameterized graph

884 views • 45 slides
Faster quantum algorithm for evaluating game trees x 7 x 8 x 1 x 2 x 3 x 4 x 1 Ben Reichardt x 6

Faster quantum algorithm for evaluating game trees x 7 x 8 x 1 x 2 x 3 x 4 x 1 Ben Reichardt x 6

Faster quantum algorithm for evaluating game trees x 7 x 8 x 1 x 2 x 3 x 4 x 1 Ben Reichardt x 6 x 9 x 5 x 9 OR x 1 x 1 University of Waterloo x 5 AND OR AND AND OR AND ( x ) x 7 x 8 x 1 x 2 x 3 x 4 x 1 x 6 x 9 x 5 x 9 OR x 1 x 1 x 5

409 views • 24 slides
1 Weights Need Not be Reals Goal: Parameterized FSMs a/ q / p b/ r Parameterized FSM:

1 Weights Need Not be Reals Goal: Parameterized FSMs a/ q / p b/ r Parameterized FSM:

Parameterized Finite-State Outline The Vision Slide! Machines and their Training 1. Finite-state machines as a shared modeling Jason Eisner Jason Eisner language. Johns Hopkins University October 16, 2002 AT&T Speech Days 2.

546 views • 13 slides
Parameterized Streaming Algorithms Graham Cormode Rajesh Chitnis Parameterized Streaming

Parameterized Streaming Algorithms Graham Cormode Rajesh Chitnis Parameterized Streaming

Towards a Theory ry of f Parameterized Streaming Algorithms Graham Cormode Rajesh Chitnis Parameterized Streaming Algorithms We increasingly have to deal with huge graphs Facebook graph Brain graph Google Maps in USA Web Graph 10

334 views • 16 slides
A Faster Algorithm for the Steiner Tree Problem Daniel M olle, Stefan Richter, and Peter

A Faster Algorithm for the Steiner Tree Problem Daniel M olle, Stefan Richter, and Peter

A Faster Algorithm for the Steiner Tree Problem Daniel M olle, Stefan Richter, and Peter Rossmanith Department of Computer Science, RWTH Aachen University, Fed. Rep. of Germany { moelle, richter, rossmani } @cs.rwth-aachen.de Abstract. For

141 views • 10 slides
Faster Core-Set Construction and Data-Stream Algorithm in Fixed Dimentions Timothy M. Chan

Faster Core-Set Construction and Data-Stream Algorithm in Fixed Dimentions Timothy M. Chan

Faster Core-Set Construction and Data-Stream Algorithm in Fixed Dimentions Timothy M. Chan Main Results: 1) Diameter: O(n+1/ d-3/2 ), improvement from O(n+1/ d-1/2 ) 2) Width: O(n+1/ d-1 ) improvement from O(n+1/ 3(d-1)/2 ) 3)

444 views • 15 slides
Exact Rank Aggregation with Parameterized Algorithms Robert Bredereck

Exact Rank Aggregation with Parameterized Algorithms Robert Bredereck

Kemeny Ranking Parameterized Algorithms Results Conclusion + References Exact Rank Aggregation with Parameterized Algorithms Robert Bredereck Friedrich-Schiller-Universit at Jena, Germany Cost IC0602 International Doctoral School

263 views • 22 slides
Efficient Parameterized Algorithms for Data Packing Krishnendu Chatterjee, Amir Goharshady ,

Efficient Parameterized Algorithms for Data Packing Krishnendu Chatterjee, Amir Goharshady ,

Data Packing Tree Decompositions Our Algorithm Experimental Results Efficient Parameterized Algorithms for Data Packing Krishnendu Chatterjee, Amir Goharshady , Nastaran Okati, Andreas Pavlogiannis January 22, 2019 1 / 30 Data Packing Tree

630 views • 30 slides
Exact Crossing Number Exact Crossing Number Parameterized by Vertex Cover Parameterized by

Exact Crossing Number Exact Crossing Number Parameterized by Vertex Cover Parameterized by

Exact Crossing Number Exact Crossing Number Parameterized by Vertex Cover Parameterized by Vertex Cover Petr Hlin en y Petr Hlin en y Faculty of Informatics, Masaryk University Brno, Czech Republic joint work with Abhisekh

676 views • 65 slides

More recommend