scientific article; zbMATH DE number 3614188

MaRDI QIDQ4178503zbMATH OpenFDO

Authors Dexter Kozen

Publication date 1978

zbMATH Keywords

CliqueComputational ComplexityGraph IsomorphismNp-Complete

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Cited in

(5)

• Graph isomorphism problem
• A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation
• Distance formula for direct-co-direct product in the case of disconnected factors
• On some metric properties of direct-co-direct product
• Graph isomorphism: physical resources, optimization models, and algebraic characterizations

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 Q4178503)