Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality

DOI10.1016/j.ipl.2023.106425zbMath1529.05149arXiv2112.07204OpenAlexW4381620609MaRDI QIDQ6072209

Chenglong Xiao, Shan-shan Wang, Emmanuel Casseau

Publication date: 12 October 2023

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

graph algorithmssubgraph enumerationreverse searchconnected induced subgraphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Reverse search for enumeration
• A Polynomial Delay Algorithm for Generating Connected Induced Subgraphs of a Given Cardinality
• Depth-First Search and Linear Graph Algorithms
• Enumerating connected induced subgraphs: improved delay and experimental comparison

This page was built for publication: Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality