Computing Branchwidth via Efficient Triangulations and Blocks Authors: F.V. Fomin, F. Mazoit, I. Todinca Presented by: Elif Kolotoglu, ISE, Texas A&M University.

Slides:



Advertisements
Similar presentations
Approximation algorithms for geometric intersection graphs.
Advertisements

22C:19 Discrete Math Graphs Fall 2014 Sukumar Ghosh.
Divide and Conquer. Subject Series-Parallel Digraphs Planarity testing.
Presented By: Saleh A. Almugrin * Based and influenced by many works of Hans L. Bodlaender, * Based and influenced by many works of Hans.
Graph Isomorphism Algorithms and networks. Graph Isomorphism 2 Today Graph isomorphism: definition Complexity: isomorphism completeness The refinement.
1 A Faster Approximation Algorithm For The Steiner Problem In Graphs Kurt Mehlhorn. Information Processing Letters, 27(3):125–128, 高等演算法二
Rooted Routing Using Structural Decompositions Jiao Tong University Shanghai, China June 17, 2013.
B IPARTITE I NDEX C ODING Arash Saber Tehrani Alexandros G. Dimakis Michael J. Neely Department of Electrical Engineering University of Southern California.
1 NP-Complete Problems. 2 We discuss some hard problems:  how hard? (computational complexity)  what makes them hard?  any solutions? Definitions 
CS774. Markov Random Field : Theory and Application Lecture 17 Kyomin Jung KAIST Nov
Complexity 16-1 Complexity Andrei Bulatov Non-Approximability.
CSC5160 Topics in Algorithms Tutorial 2 Introduction to NP-Complete Problems Feb Jerry Le
The Complexity of the Network Design Problem Networks, 1978 Classic Paper Reading
16:36MCS - WG20041 On the Maximum Cardinality Search Lower Bound for Treewidth Hans Bodlaender Utrecht University Arie Koster ZIB Berlin.
FPT algorithmic techniques: Treewidth (1)
© 2006 Pearson Addison-Wesley. All rights reserved14 A-1 Chapter 14 Graphs.
Welcome to the TACO Project Finding tree decompositions Hans L. Bodlaender Institute of Information and Computing Sciences Utrecht University.
Perfect Graphs Lecture 23: Apr 17. Hard Optimization Problems Independent set Clique Colouring Clique cover Hard to approximate within a factor of coding.
NP-Complete Problems Reading Material: Chapter 10 Sections 1, 2, 3, and 4 only.
Computational Complexity, Physical Mapping III + Perl CIS 667 March 4, 2004.
Efficient algorithms for Steiner Tree Problem Jie Meng.
A 2-Approximation algorithm for finding an optimum 3-Vertex-Connected Spanning Subgraph.
Fixed-Parameter Algorithms for (k,r)-Center in Planar Graphs and Map Graphs Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi, and Dimitrios M.
Steiner trees Algorithms and Networks. Steiner Trees2 Today Steiner trees: what and why? NP-completeness Approximation algorithms Preprocessing.
Chapter 5: Computational Complexity of Area Minimization in Multi-Layer Channel Routing and an Efficient Algorithm Presented by Md. Raqibul Hasan Std No.
Constant Factor Approximation of Vertex Cuts in Planar Graphs Eyal Amir, Robert Krauthgamer, Satish Rao Presented by Elif Kolotoglu.
The Theory of NP-Completeness 1. Nondeterministic algorithms A nondeterminstic algorithm consists of phase 1: guessing phase 2: checking If the checking.
Fixed Parameter Complexity Algorithms and Networks.
Graph Coalition Structure Generation Maria Polukarov University of Southampton Joint work with Tom Voice and Nick Jennings HUJI, 25 th September 2011.
Efficient Gathering of Correlated Data in Sensor Networks
Kernel Bounds for Structural Parameterizations of Pathwidth Bart M. P. Jansen Joint work with Hans L. Bodlaender & Stefan Kratsch July 6th 2012, SWAT 2012,
Approximating Minimum Bounded Degree Spanning Tree (MBDST) Mohit Singh and Lap Chi Lau “Approximating Minimum Bounded DegreeApproximating Minimum Bounded.
1 Treewidth, partial k-tree and chordal graphs Delpensum INF 334 Institutt fo informatikk Pinar Heggernes Speaker:
Approximating the Minimum Degree Spanning Tree to within One from the Optimal Degree R 陳建霖 R 宋彥朋 B 楊鈞羽 R 郭慶徵 R
Prabhas Chongstitvatana1 NP-complete proofs The circuit satisfiability proof of NP- completeness relies on a direct proof that L  p CIRCUIT-SAT for every.
Approximation Algorithms
1 Steiner Tree Algorithms and Networks 2014/2015 Hans L. Bodlaender Johan M. M. van Rooij.
NP-Complete Problems. Running Time v.s. Input Size Concern with problems whose complexity may be described by exponential functions. Tractable problems.
The Dominating Set and its Parametric Dual  the Dominated Set  Lan Lin prepared for theory group meeting on June 11, 2003.
Graph Theory and Applications
NP-completeness NP-complete problems. Homework Vertex Cover Instance. A graph G and an integer k. Question. Is there a vertex cover of cardinality k?
Introduction to Graph Theory By: Arun Kumar (Asst. Professor) (Asst. Professor)
Algorithms for hard problems Parameterized complexity Bounded tree width approaches Juris Viksna, 2015.
The geometric GMST problem with grid clustering Presented by 楊劭文, 游岳齊, 吳郁君, 林信仲, 萬高維 Department of Computer Science and Information Engineering, National.
ICS 353: Design and Analysis of Algorithms NP-Complete Problems King Fahd University of Petroleum & Minerals Information & Computer Science Department.
Branchwidth via Integer Programming
Graphs and Algorithms (2MMD30)
An introduction to chordal graphs and clique trees
Algorithms for Finding Distance-Edge-Colorings of Graphs
Hans Bodlaender, Marek Cygan and Stefan Kratsch
Efficient algorithms for Steiner Tree Problem
Parameterized complexity Bounded tree width approaches
Algorithms and networks
Exact Inference Continued
Algorithms and Complexity
Computability and Complexity
Structural graph parameters Part 2: A hierarchy of parameters
ICS 353: Design and Analysis of Algorithms
Intro to NP Completeness
Bart M. P. Jansen June 3rd 2016, Algorithms for Optimization Problems
Approximation and Kernelization for Chordal Vertex Deletion
Algorithms and networks
Boi Faltings and Martin Charles Golumbic
Computation Basics & NP-Completeness
Boi Faltings and Martin Charles Golumbic
Prabhas Chongstitvatana
Graphs and Algorithms (2MMD30)
NP-Completeness Reference: Computers and Intractability: A Guide to the Theory of NP-Completeness by Garey and Johnson, W.H. Freeman and Company, 1979.
Power domination on probe interval graphs
Treewidth meets Planarity
Presentation transcript:

Computing Branchwidth via Efficient Triangulations and Blocks Authors: F.V. Fomin, F. Mazoit, I. Todinca Presented by: Elif Kolotoglu, ISE, Texas A&M University

Outline Introduction Definitions Theorems Algorithm Conclusion

Introduction Proceedings of the 31st Workshop on Graph Theoretic Concepts in Computer Science (WG 2005), Springer LNCS vol. 3787, 2005, pp An algorithm to compute the branchwidth of a graph on n vertices in time (2 + √3) n · n O(1) is presented The best known was 4 n · n O(1)

Introduction Branch decomposition and branchwidth were introduced by Robertson and Seymour in 1991 Useful for solving NP-hard problems when the input is restricted to graphs of bounded branchwidth Testing whether a general graph has branchwidth bounded by some integer k is NP-Complete (Seymour & Thomas 1994)

Introduction Branchwidth and branch decompositions are strongly related with treewidth and tree decompositions For any graph G, bw(G) ≤ tw(G) + 1 ≤ Floor(3/2 bw(G)) But the algorithmic behaviors are not quite same

Introduction On planar graphs computing branchwidth is solvable in polynomial time while computing the treewidth in polynomial time is still an open problem On split graphs computing branchwidth is NP hard, although it is linear time solvable to find the treewidth

Introduction Running times of exact algorithms for treewidth  O*( n ) by Fomin, Kratsch, Todinca-2004  O*( n ) by Villanger-2006  O*(4 n ) with polynomial space by Bodlaender, Fomin, Koster, Kratsch, Thilikos-2006  O*( n ) with polynomial space by Bodlaender, Fomin, Koster, Kratsch, Thilikos-2006

Outline Introduction Definitions Theorems Algorithm Conclusion

Definitions Let G = (V, E) be an undirected and simple graph with |V|=n, |E|=m and let T be a ternary tree with m leaves Let η be a bijection from the edges of G to the leaves of T Then the pair (T, η) is called a branch decomposition of G. a b c d e a b e c d

Definitions The vertices of T will be called nodes, and the edges of T will be called branches Removing a branch e from T partitions T into two subtrees T 1 (e) and T 2 (e). lab(e) is the set of vertices of G both incident to edges mapped on T 1 (e) and T 2 (e). a b c d e a b e c d

Definitions The maximum size over all lab(e) is the width of the branch decomposition (T, η) The branchwidth of G, denoted by β(G), is the minimum width over all branch decompositions of G A branch decomposition of G with width equal to the branchwidth is an optimal branch decomposition

Example

Definitions A graph G is chordal if every cycle of G with at least 4 vertices has a chord(an edge between two non-consecutive vertices of a cycle) A supergraph H=(V,F) of G=(V, E) (i.e. E is a subset of F) is a triangulation of G if H is chordal If no strict subgraph of H is a triangulation of G, then H is called a minimal triangulation

Definitions For each x in V we can associate a subtree T x covering all the leaves of the branch decomposition T that are corresponding to the incident edges of x The intersection graph of the subtrees of a tree is chordal The intersection graph of the subtrees T x is a triangulation H(T, η) of G. Lab(e) induces a clique in H

Outline Introduction Definitions Theorems Algorithm Conclusion

Theorems The basic result states that, for any graph G, there is an optimal branch decomposition (T, η) such that H(T, η) is an efficient triangulation of G To compute the branchwidth, this result is combined with an exponential time algorithm computing the branchwidth of hyper-cliques

Theorems A triangulation H of G is efficient if  Each minimal separator of H is also a minimal separator of G;  For each minimal separator S of H the connected components of H-S are exactly the connected components of G-S

Theorems Theorem 1: There is an optimal branch decomposition (T, η) of G s.t. the chordal graph H (T, η) is an efficient triangulation of G. Moreover, each minimal separator of H is the label of some branch of T.

Theorems A set of vertices B in V of G is called a block if, for each connected component C i of G-B,  its neighborhood S i =N(C i ) is a minimal separator  B\S i is non empty and contained in a connected component of G-S i B CiCi SiSi

Theorems The minimal separators S i border the block B and the set of these minimal separators are denoted by S(B) The set of blocks of G is denoted by B G

Theorems Lemma 1&2: If H is an efficient triangulation of G, then any maximal clique K of H is a block of G, and for any block B of G, there is an efficient triangulation H(B) of G s.t. B induces a maximal clique in H

Theorems Let B be a block of G and K(B) be the complete graph with vertex set B. A branch decomposition (T B, η B ) of K(B) respects the block B if, for each bordering minimal separator S in S(B), there is a branch e of the decomposition s.t. S is a subset of lab(e). The block branchwidth bbw(B) of B is the minimum width over all the branch decompositions of K(B) respecting B

Theorems Theorem 2: Theorem 4: Given a graph G and the list B G of all its blocks together with their block-branchwidth, the branchwidth of G can be computed in O(nm|B(G)|) time

Theorems n(B): # of vertices of block B s(B): # of minimal separators bordering B Theorem 5: The block-branchwidth of any block B can be computed in O*(3 s(B) ) time Theorem 6: The block-branchwidth of any block B can be computed in O*(3 n(B) ) time

Theorems s(B) is at most the # of components of G- B, so n(B)+s(B)≤n At least one s(B) or n(B) ≤ n/2, then Theorem 7: For any block B of G, the block-branchwidth of B can be computed in O*(√3 n ) time

Thorems Theorem 8: The branchwidth of a graph can be computed in O*((2+√3) n ) time Pf: Every subset B of V is checked (in polynomial time) if it is a block or not. The block- branchwidth is computed for each block. The number of blocks is at most 2 n ) and for each block O*(√3 n ) time is needed. And the branchwidth is computed using Theorem 4 in O*(2 n ) time.

Outline Introduction Definitions Theorems Algorithm Conclusion

Algorithm Given a minimal separator S of G and a connected component C of G-S, R(S,C) denotes the hypergraph obtained from G[SUC] by adding the hyperedge S. C S

Algorithm Input: G, all its blocks and all its minimal separators Output: bw(G)  Compute all the pairs {S,C} where S is a minimal separator and C a component of G-S with S=N(C); sort them by the size of SUC  for each {S,C} taken in increasing order bw(R(S,C))=bbw(SUC) for each block Ω with  compute the components C i of G-Ω contained in C and let S i =N(C i )   let ∆* G be the set of inclusion minimal separators of G  bw(G)=

Outline Introduction Definitions Theorems Algorithm Conclusion

Conclusion Enumerating the blocks in a graph and finding the block-branchwidth of the blocks leads to a O*((2+√3) n ) time algorithm for the branchwidth problem This is the best algorithm for branchwidth problem

Conclusion Open problems for future research:  Is there a faster way of computing block branchwidth?  Can we find any smaller class of triangulations (compared to efficient triangulations) that contains H (T, η), for some optimal branch decompositions of the graph?