scientific article
From MaRDI portal
Publication:3912033
zbMath0462.68040MaRDI QIDQ3912033
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items
The QAP-polytope and the graph isomorphism problem, Tight lower and upper bounds for the complexity of canonical colour refinement, Towards an isomorphism dichotomy for hereditary graph classes, Completeness results for graph isomorphism., Isomorphism of graphs of bounded valence can be tested in polynomial time, An appraisal of computational complexity for operations researchers, Polynomial-time algorithm for isomorphism of graphs with clique-width at most three, An optimal lower bound on the number of variables for graph identification, Colored hypergraph isomorphism is fixed parameter tractable, Graph theory (algorithmic, algebraic, and metric problems), Graph isomorphism is low for PP, Graph isomorphism problem
