Tree / Branch Decompositions and Their Applications

@inproceedings{Gu2009TreeB,
  title={Tree / Branch Decompositions and Their Applications},
  author={Q. Gu},
  year={2009}
}
The notions of tree decompositions and branch decompositions have received much attention in discrete optimizations. These notions were originally introduced by Robertson and Seymour [15, 16] in the proof of the Graph Minors Theorem, known as Wagner’s conjecture. It is known that practical problems in several research areas, like VLSI design, Cholesky… CONTINUE READING