Efficient enumeration of subgraphs and induced subgraphs with bounded girth

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

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

Publication date: 6 September 2018

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

Recommendations

• Listing acyclic subgraphs and subgraphs of bounded girth in directed graphs
• A faster algorithm for computing the girth of planar and bounded genus graphs
• scientific article; zbMATH DE number 7053319
• An efficient algorithm for enumerating induced subgraphs with bounded degeneracy
• Enumerating connected induced subgraphs: improved delay and experimental comparison

Mathematics Subject Classification ID

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

Cited In (6)

• Listing subgraphs by Cartesian decomposition
• Finding and counting small induced subgraphs efficiently
• An efficient algorithm for enumerating chordal bipartite induced subgraphs in sparse graphs
• Efficient enumeration of non-isomorphic interval graphs
• Enumerating minimal transversals of hypergraphs without small holes
• Listing acyclic subgraphs and subgraphs of bounded girth in directed graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1671003)