6 citations · 27 across the 25 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
math.CO2009★ 1 cited
On the boolean-width of a graph: structure and applications
Y. Rabinovich, J. A. Telle
We study the recently introduced boolean-width of graphs. Our structural results are as follows. Firstly, we show that almost surely the boolean-width of a random graph on vert…
cs.DS2009★ 6 cited
Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions
B. -M. Bui-Xuan, J. A. Telle, M. Vatshelle
We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. Boolean-width is similar to rank-width, which is…