A polynomial delay algorithm for enumerating 2-edge-connected induced subgraphs

DOI10.1007/978-3-030-59901-0_2OpenAlexW3088682254MaRDI QIDQ2037960FDOQ2037960

Takashi Hirayama, Katsuhisa Yamanaka, Yusuke Sano

Publication date: 8 July 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-59901-0_2

zbMATH Keywords

polynomial delayenumeration algorithmreverse search2-edge-connected induced subgraph

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited In (2)

• Enumeration of support-closed subsets in confluent systems
• On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay

Recommendations

• Title not available (Why is that?) 👍 👎
• Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs 👍 👎
• A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs 👍 👎
• An efficient algorithm for enumerating induced subgraphs with bounded degeneracy 👍 👎
• A linear delay algorithm for enumeration of 2-edge/vertex-connected induced subgraphs 👍 👎
• New polynomial delay bounds for maximal subgraph enumeration by proximity search 👍 👎
• Polynomial-delay enumeration of monotonic graph classes 👍 👎
• A Polynomial Delay Algorithm for Generating Connected Induced Subgraphs of a Given Cardinality 👍 👎
• Enumerating connected induced subgraphs: improved delay and experimental comparison 👍 👎
• Enumerating connected induced subgraphs: improved delay and experimental comparison 👍 👎

This page was built for publication: A polynomial delay algorithm for enumerating 2-edge-connected induced subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2037960)