scientific article; zbMATH DE number 3617539

zbMath0397.68039MaRDI QIDQ4181269

Dominic J. A. Welsh, Eric C. Milner

Publication date: 1976

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

zbMATH Keywords

adjacency matricesprobingcomputational complexity of graph theoretical properties

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (9)

Evasiveness through binary decision diagrams ⋮ Using Brouwer’s Fixed Point Theorem ⋮ The smallest nonevasive graph property ⋮ On the elusiveness of Hamiltonian property ⋮ Complete subgraphs are elusive ⋮ Further results on the Aanderaa-Rosenberg conjecture ⋮ On recognizing graph properties from adjacency matrices ⋮ Packings of graphs and applications to computational complexity ⋮ Packing of graphs - a survey

This page was built for publication: