A linear delay algorithm for enumeration of 2-edge/vertex-connected induced subgraphs

DOI10.1007/978-3-031-34347-6_31arXiv2302.05526OpenAlexW4379117939MaRDI QIDQ6182922

Takumi Tada, Kazuya Haraguchi

Publication date: 22 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2302.05526

zbMATH Keywords

binary partitionlinear delay2-edge-connectivity2-vertex-connectivityenumeration of subgraphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• An efficient algorithm for solving pseudo clique enumeration problem
• A note on finding the bridges of a graph
• Reverse search for enumeration
• Fast maximal cliques enumeration in sparse graphs
• Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
• Enumeration of support-closed subsets in confluent systems
• Congruent Graphs and the Connectivity of Graphs
• Dividing a Graph into Triconnected Components
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: A linear delay algorithm for enumeration of 2-edge/vertex-connected induced subgraphs