scientific article
From MaRDI portal
Publication:3865476
zbMath0428.68052MaRDI QIDQ3865476
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (05C99) Algorithms in computer science (68W99)
Related Items
Fast canonical labeling of random subgraphs ⋮ Power-law decay of the degree-sequence probabilities of multiple random graphs with application to graph isomorphism ⋮ Concerning the complexity of deciding isomorphism of block designs ⋮ Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations ⋮ The invariant problem for binary string structures and the parallel complexity theory of queries ⋮ Improved random graph isomorphism ⋮ Degree lower bounds of tower-type for approximating formulas with parity quantifiers
