A Polynomial Delay Algorithm for Generating Connected Induced Subgraphs of a Given Cardinality
From MaRDI portal
Publication:5250133
DOI10.7155/jgaa.00357zbMath1312.05132arXiv1411.2262OpenAlexW2964062467MaRDI QIDQ5250133
Publication date: 18 May 2015
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.2262
Related Items (4)
A general purpose algorithm for counting simple cycles and simple paths of any length ⋮ Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality ⋮ Enumerating connected induced subgraphs: improved delay and experimental comparison ⋮ Unnamed Item
This page was built for publication: A Polynomial Delay Algorithm for Generating Connected Induced Subgraphs of a Given Cardinality
