A polynomial delay algorithm for enumerating 2-edge-connected induced subgraphs
type: Item
instance of: scholarly article
title: A polynomial delay algorithm for enumerating 2-edge-connected induced subgraphs
DOI: 10.1007/978-3-030-59901-0_2
author: Yusuke Sano
author: Katsuhisa Yamanaka
author: Takashi Hirayama
publication date: 2021-07-08T00:00:00Z
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7369997
zbMATH Keywords: enumeration algorithm
zbMATH Keywords: 2-edge-connected induced subgraph
zbMATH Keywords: reverse search
zbMATH Keywords: polynomial delay
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-030-59901-0 2
OpenAlex ID: W3088682254
Recommended article: A linear delay algorithm for enumeration of 2-edge/vertex-connected induced subgraphs
Recommended article: A Polynomial Delay Algorithm for Generating Connected Induced Subgraphs of a Given Cardinality
Recommended article: Enumerating connected induced subgraphs: improved delay and experimental comparison
Recommended article: Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs
Recommended article: An efficient algorithm for enumerating induced subgraphs with bounded degeneracy
Recommended article: New polynomial delay bounds for maximal subgraph enumeration by proximity search
Recommended article: Q5875563
Recommended article: A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs
Recommended article: Polynomial-delay enumeration of monotonic graph classes
description: scientific article; zbMATH DE number 7369997