Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

DAM

2010

2010

We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges between two given graphs by taking partitions of their two vertex sets, identifying the classes of the partitions with vertices of H , and connecting classes by the pattern H . H -join decompositions are related to modular, split and rank decompositions. Given an H -join decomposition of an n-vertex m-edge graph G we solve the Maximum Independent Set and Minimum Dominating Set problems on G in time O(n(m+2O((H)2 ) )), and the q-Coloring problem in time O(n(m + 2O(q(H)2 ) )), where (H) is the rank of the adjacency matrix of H over GF(2). Rankwidth is a graph parameter introduced by Oum and Seymour, based on ranks of adjacency matrices over GF(2). For any positive integer k we define a bipartite graph Rk and show that the graphs of rankwidth at most k are exactly the graphs having an Rk -join decomposition, there...

Added |
10 Dec 2010 |

Updated |
10 Dec 2010 |

Type |
Journal |

Year |
2010 |

Where |
DAM |

Authors |
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle |

Comments (0)