Computing a Clique Tree with the Algorithm Maximal Label Search

Computing a Clique Tree with the Algorithm Maximal Label Search

The algorithm MLS (Maximal Label Search) is a graph search algorithm that generalizes the algorithms Maximum Cardinality Search (MCS), Lexicographic Breadth-First Search (LexBFS), Lexicographic Depth-First Search (LexDFS) and Maximal Neighborhood Search (MNS). On a chordal graph, MLS computes a PEO...

Full description

Bibliographic Details
Main Authors: Anne Berry, Geneviève Simonet
Format: Article
Language:English
Published: MDPI AG 2017-01-01
Series:Algorithms
Subjects:
chordal graph
clique tree
perfect elimination ordering
perfect moplex ordering
Maximal Label Search
LexBFS
MCS
Online Access:http://www.mdpi.com/1999-4893/10/1/20

Internet

http://www.mdpi.com/1999-4893/10/1/20

Similar Items