A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
type: Item
instance of: scholarly article
title: A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
zbMATH Open document ID: 1259.05158
author: Anne Berry
author: Romain Pogorelcnik
published in: Information Processing Letters
publication date: 2013-03-28T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6149216
zbMATH Keywords: graph algorithms
zbMATH Keywords: LexBFS
zbMATH Keywords: MCS
zbMATH Keywords: minimal separator
zbMATH Keywords: maximal clique
zbMATH Keywords: moplex ordering
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.02.013
OpenAlex ID: W2047092660
cites work: Separability generalizes Dirac's theorem
cites work: Moplex elimination orderings
cites work: Graph extremities defined by search algorithms
cites work: Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings
cites work: Q4288578
cites work: A Unified View of Graph Searching
cites work: Incidence matrices and interval graphs
cites work: Minimal vertex separators of chordal graphs
cites work: Triangulated graphs and the elimination process
cites work: Algorithmic Aspects of Vertex Elimination on Graphs
cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
DOI: 10.1016/J.IPL.2011.02.013
Recommended article: A linear time algorithm to list the minimal separators of chordal graphs
Recommended article: Q4551369
Recommended article: Q3035321
Recommended article: One-phase algorithm for the determination of minimal vertex separators of chordal graphs
Recommended article: A generalization of chordal graphs and the maximum clique problem
Recommended article: The clique-separator graph for chordal graphs
Recommended article: Minimal vertex separators of chordal graphs
Recommended article: A separator-based method for generating weakly chordal graphs
Recommended article: How to use the minimal separators of a graph for its chordal triangulation
Recommended article: Q3582532
description: scientific article; zbMATH DE number 6149216