On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs

From MaRDI portal

(Redirected from Publication:2633284)
On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs

Jump to:navigation, search

MaRDI QID[[Item:|]]

Authors

No records found

Cited in

No records found

This page was built for publication:

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=On_finding_and_enumerating_maximal_and_maximum_%5C(_k%5C)-partite_cliques_in_%5C(_k%5C)-partite_graphs&oldid=79320338"