scientific article; zbMATH DE number 1754602

zbMath0986.68039MaRDI QIDQ4535027

Martin Fuerer

Publication date: 12 June 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2076/20760322

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

gamesdescriptive complexitygraph isomorphism testingWeisfeiler-Lehman refinement

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Descriptive complexity and finite models (68Q19)

Related Items (2)

Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements ⋮ Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic

This page was built for publication: