scientific article; zbMATH DE number 4003527

zbMATH Open0618.68042MaRDI QIDQ4728247FDOQ4728247

Authors: Eberhard Triesch 

Publication date: 1984

Title of this publication is not available (Why is that?)

Recommendations

• A topological approach to evasiveness
• An asymptotic bound for the complexity of monotone graph properties
• A generalized model for understanding evasiveness
• The smallest nonevasive graph property
• Simplicial complexes and the evasiveness conjecture

zbMATH Keywords

graph propertiesevasivenessadjacency listadjecency matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Cited In (4)

• The amazing graphene: an educational bridge connecting different physics concepts
• On the recognition complexity of some graph properties
• Searching for an edge in a graph
• Ein Planaritätstest für planar-konvexe Grapheneinbettungen mit linearer Komplexität

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4728247)