scientific article
From MaRDI portal
Publication:3113761
DOI10.4230/LIPIcs.STACS.2010.2467zbMath1230.68106MaRDI QIDQ3113761
Pascal Tesson, Andrei A. Krokhin, László Egri, Benoit Larose
Publication date: 23 January 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_9cc0.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items