wiki_research

personal research wiki
git clone https://a3nm.net/git/wiki_research/
Log | Files | Refs

boolean_width (414B)

      1 # Boolean width
      2 
      3 buixuan2011boolean
      4 
      5 Build a binary [tree] on the vertices of the graph in a certain order such that each edge cut of the tree induces a bipartition where the number of neighborhoods (only considering the neighborhoods to vertices of the other side) is bounded
      6 
      7 Up to a constant factor, the tree can be assumed to be balanced ([balancing])
      8 
      9 See also: [rankwidth], [twin_width]
     10 
     11 Up: [width_measure]