Bounding the mim-width of hereditary graph classes

HIGHLIGHTS

• who: Nick Brettell and collaborators from the Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, GermanySchool of Mathematics and Statistics, Victoria University of Wellington, New Zealand have published the research work: Bounding the Mim-Width of Hereditary Graph Classes, in the Journal: (JOURNAL)
• what: The authors show that the same is not true for (H1 H2 )-free graphs. The authors show that a branch decomposition of constant mim-width can be found in polynomial time for these Hence as mentioned these results have algorithmic implications: when the input is restricted to such a class . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or Email

  Password

  Remember me

  Lost your password?

  If you don't have an account, you can create one here.