1 citations · 1 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
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…