Maximum clique exhaustive search in circulant \(k\)-hypergraphs

From MaRDI portal

Publication:2301758

Jump to:navigation, search

DOI10.1007/978-3-030-25005-8_31OpenAlexW2960183494MaRDI QIDQ2301758

Lucia Moura, Lachlan Plant

Publication date: 25 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-25005-8_31

Mathematics Subject Classification ID

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

This page was built for publication: Maximum clique exhaustive search in circulant \(k\)-hypergraphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2301758&oldid=14875023"