A generalized model for understanding evasiveness

DOI10.1016/0020-0190(89)90214-7zbMath0684.68044OpenAlexW2042143555MaRDI QIDQ1825645

Alok Aggarwal, Don Coppersmith, Daniel J. Kleitman

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90214-7

zbMATH Keywords

evasivenessgraph properties

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Reconstructing graphs from cut-set sizes ⋮ Connectivity vs. reachability

Cites Work

• On recognizing graph properties from adjacency matrices

This page was built for publication: A generalized model for understanding evasiveness