Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
type: Item
instance of: scholarly article
title: Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
zbMATH Open document ID: 1201.05098
author: Ken Takata
published in: Discrete Applied Mathematics
publication date: 2010-11-05T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5810761
zbMATH Keywords: graph algorithms
zbMATH Keywords: minimal vertex separator
zbMATH Keywords: listing algorithms
zbMATH Keywords: polynomial space
zbMATH Keywords: backtracking
MaRDI profile type: Publication
full work available at URL: j.dam.2010.05.013
OpenAlex ID: W1987604867
cites work: Q4944976
cites work: A local approach to concept generation
cites work: Representing a concept lattice by a graph
cites work: Safe separators for treewidth
cites work: Treewidth and minimum fill-in: Grouping the minimal separators
cites work: Efficient Algorithms for Listing Combinatorial Structures
cites work: On generating all maximal independent sets
cites work: Listing all Minimal Separators of a Graph
cites work: Efficient enumeration of all minimal separators in a graph
cites work: An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
DOI: 10.1016/J.DAM.2010.05.013
description: scientific article; zbMATH DE number 5810761