Algorithm 457: finding all cliques of an undirected graph

From MaRDI portal
Revision as of 04:30, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5677064

DOI10.1145/362342.362367zbMATH Open0261.68018OpenAlexW2116007667WikidataQ56210395 ScholiaQ56210395MaRDI QIDQ5677064

Author name not available (Why is that?)

Publication date: 1973

Published in: (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/362342.362367




Mathematics Subject Classification ID

No records found.








This page was built for publication: Algorithm 457: finding all cliques of an undirected graph

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

Retrieved from "https://mardi.schubotz.org/w/index.php?title=Publication:5677064&oldid=30388104"
Powered by MediaWiki