Efficient enumeration of subgraphs and induced subgraphs with bounded girth

DOI10.1007/978-3-319-94667-2_17OpenAlexW3106505245MaRDI QIDQ1671003

Alessio Conte, Hiroki Arimura, Kunihiro Wasa, Takeaki Uno, Kazuhiro Kurita

Publication date: 6 September 2018

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

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ Enumerating Minimal Transversals of Hypergraphs without Small Holes

This page was built for publication: Efficient enumeration of subgraphs and induced subgraphs with bounded girth