M. Rao

most citedNLC-2 graph recognition and isomorphism

8 citations · 8 across the 2 of their papers we have counts for

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2007

A Note On Computing Set Overlap Classes

Pierre Charbit, Michel Habib, Vincent Limouzy +3

Let $V$ be a finite set of $n$ elements and $F = {X_{1}, X_{2}, > ..., X_{m}}$ a family of $m$ subsets of $V .$ Two sets $X_{i}$ and $X_{j}$ of $F$ overlap if $X_i \…

cs.DS2007★ 8 cited

NLC-2 graph recognition and isomorphism

Vincent Limouzy, Fabien De Montgolfier, Michaël Rao

NLC-width is a variant of clique-width with many application in graph algorithmic. This paper is devoted to graphs of NLC-width two. After giving new structural properties of the c…