Enumerating connected induced subgraphs: improved delay and experimental comparison

DOI10.1007/978-3-030-10801-4_22zbMath1445.68168OpenAlexW2911224107MaRDI QIDQ5918979

Christian Komusiewicz, Frank Sommer

Publication date: 22 October 2020

Published in: SOFSEM 2019: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-10801-4_22

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs

This page was built for publication: Enumerating connected induced subgraphs: improved delay and experimental comparison