An efficient algorithm for enumerating induced subgraphs with bounded degeneracy

DOI10.1007/978-3-030-04651-4_3OpenAlexW2901681133MaRDI QIDQ2327103

Kunihiro Wasa, Takeaki Uno

Publication date: 11 October 2019

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

zbMATH Keywords

graph algorithms\(k\)-degenerate graphspolynomial delayenumeration algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

This page was built for publication: An efficient algorithm for enumerating induced subgraphs with bounded degeneracy