The generalized almost resolvable cycle system problem
- 作者Peter Adams; Elizabeth J. Billington; D. G. Hoffman; C. C. Lindner
- 卷第30卷
- 期第6期
- 印刷ISSN0209-9683
- 电子ISSN1439-6912
- 文件大小170.31KB
- 发表时间2010-11
- DOI10.1007/s00493-010-2525-z
- 页码617-625
Testing subgraphs in directed graphsNoga Alon; Asaf Shapira · 2004
Testing satisfiabilityNoga Alon; Asaf Shapira · 2003
Every Monotone Graph Property Is TestableAlon, Noga; Shapira, Asaf · SIAM Journal on Computing · 2008
A Characterization of Easily Testable Induced SubgraphsALON, NOGA; SHAPIRA, ASAF · Combinatorics, Probability and Computing · 2006
Can a Graph Have Distinct Regular Partitions?Alon, Noga; Shapira, Asaf; Stav, Uri · SIAM Journal on Discrete Mathematics · 2009
An Elementary Construction of Constant-Degree ExpandersALON, NOGA; SCHWARTZ, ODED; SHAPIRA, ASAF · Combinatorics, Probability and Computing · 2008
A Characterization of the (Natural) Graph Properties Testable with One-Sided ErrorAlon, Noga; Shapira, Asaf · SIAM Journal on Computing · 2008