Efficient enumeration of all minimal separators in a graph
type: Item
instance of: scholarly article
title: Efficient enumeration of all minimal separators in a graph
zbMATH Open document ID: 0901.68145
DOI: 10.1016/S0304-3975(97)83809-1
author: Hong Shen
author: W. Liang
published in: Theoretical Computer Science
publication date: 1998-07-22T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 1177594
zbMATH Keywords: minimal separators
MaRDI profile type: Publication
cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
cites work: Q3140396
cites work: Q3684121
cites work: Efficient Algorithms for Listing Combinatorial Structures
cites work: Q3328583
cites work: Computing connected components on parallel computers
cites work: Q3138919
cites work: Q4942656
cites work: Q5585020
cites work: An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
full work available at URL: s0304-3975(97)83809-1
OpenAlex ID: W2074211284
Recommended article: Q4944976
Recommended article: GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
Recommended article: Q4944975
Recommended article: On the number of minimal separators in graphs
Recommended article: On the Number of Minimal Separators in Graphs
Recommended article: Efficiently enumerating minimal triangulations
Recommended article: Listing all Minimal Separators of a Graph
Recommended article: Q4551369
Recommended article: Finding all minimum-size separating vertex sets in a graph
Recommended article: Q5089231
description: scientific article; zbMATH DE number 1177594