Loading...

Hyper-T-width and hyper-D-width: Stable connectivity measures for hypergraphs

Safari, M ; Sharif University of Technology | 2012

497 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.tcs.2012.09.010
  3. Publisher: 2012
  4. Abstract:
  5. We introduce hyper-D-width and hyper-T-width as the first stable (see Definition 3) measures of connectivity for hypergraphs. After studying some of their properties and, in particular, proposing an algorithm for computing nearly optimal hyper-T-decomposition when hyper-T-width is constant, we introduce some applications of hyper-D-width and hyper-T-width in solving hard problems such as minimum vertex cover, minimum dominating set, and multicut
  6. Keywords:
  7. Hard problems ; Hyper graph ; Minimum dominating set ; Minimum vertex cover ; Multicuts ; Computer science ; Graph theory
  8. Source: Theoretical Computer Science ; Volume 463 , 2012 , Pages 26-34 ; 03043975 (ISSN)
  9. URL: http://www.sciencedirect.com/science/article/pii/S0304397512008602