2 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.DS2016★ 1 cited
Computing a clique tree with algorithm MLS (Maximal Label Search)
Anne Berry, Geneviève Simonet
Algorithm MLS (Maximal Label Search) is a graph search algorithm which generalizes algorithms MCS, LexBFS, LexDFS and MNS. On a chordal graph, MLS computes a peo (perfect eliminati…
cs.DS2016
Computing the atom graph of a graph and the union join graph of a hypergraph
Anne Berry, Geneviève Simonet
The atom graph of a graph is the graph whose vertices are the atoms obtained by clique minimal separator decomposition of this graph, and whose edges are the edges of all possible…
cs.DM2013★ 2 cited
The Dilworth Number of Auto-Chordal-Bipartite Graphs
Anne Berry, Andreas Brandstädt, Konrad Engel
The mirror (or bipartite complement) mir(B) of a bipartite graph B=(X,Y,E) has the same color classes X and Y as B, and two vertices x in X and y in Y are adjacent in mir(B) if and…