Advanced clique algorithms for protein product graphs

DOI10.26493/2590-9770.1789.4E7MaRDI QIDQ7013089zbMATH OpenFDO

Authors Janez Konc, Dušanka Janežič

Publication date 13 March 2025

Published in The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.26493/2590-9770.1789.4E7

zbMATH Keywords

applicationscliquesprotein product graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76) Graph algorithms (graph-theoretic aspects) (05C85) Chemical graph theory (05C92) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Cites work

• An improved branch and bound algorithm for the maximum clique problem
• scientific article; zbMATH DE number 2040957 (Why is no real title available?)
• Reducibility among combinatorial problems

This page was built for publication: Advanced clique algorithms for protein product graphs

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