Evasiveness of subgraph containment and related properties

Amit Chakrabarti, Subhash Khot, Yaoyun Shi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks and Sturtevant [4]. For the property of containing a subgraph isomorphic to a fixed graph, and a fairly large class of related n-vertex graph properties, we show evasiveness for an arithmetic progression of values of n. This implies a ½n2 − O(n) lower bound on the decision tree complexity of these properties. We prove that properties that are preserved under taking graph minors are evasive for all sufficiently large n. This greatly generalizes the evasiveness result for planarity [1]. We prove a similar result for bipartite subgraph containment.

Original languageEnglish (US)
Title of host publicationSTACS 2001 - 18th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings
PublisherSpringer Verlag
Pages110-120
Number of pages11
Volume2010
ISBN (Print)9783540416951
StatePublished - 2001
Event18th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2001 - Dresden, Germany
Duration: Feb 15 2001Feb 17 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2010
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other18th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2001
CountryGermany
CityDresden
Period2/15/012/17/01

Fingerprint

Decision trees
Subgraph
Graph in graph theory
Graph Minors
Planarity
Arithmetic sequence
Decision tree
Monotone
Isomorphic
Lower bound
Imply
Generalise
Vertex of a graph

Keywords

  • Decision tree complexity
  • Evasiveness
  • Graph property testing
  • Monotone graph properties

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Chakrabarti, A., Khot, S., & Shi, Y. (2001). Evasiveness of subgraph containment and related properties. In STACS 2001 - 18th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings (Vol. 2010, pp. 110-120). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2010). Springer Verlag.

Evasiveness of subgraph containment and related properties. / Chakrabarti, Amit; Khot, Subhash; Shi, Yaoyun.

STACS 2001 - 18th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. Vol. 2010 Springer Verlag, 2001. p. 110-120 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2010).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chakrabarti, A, Khot, S & Shi, Y 2001, Evasiveness of subgraph containment and related properties. in STACS 2001 - 18th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. vol. 2010, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2010, Springer Verlag, pp. 110-120, 18th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2001, Dresden, Germany, 2/15/01.
Chakrabarti A, Khot S, Shi Y. Evasiveness of subgraph containment and related properties. In STACS 2001 - 18th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. Vol. 2010. Springer Verlag. 2001. p. 110-120. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Chakrabarti, Amit ; Khot, Subhash ; Shi, Yaoyun. / Evasiveness of subgraph containment and related properties. STACS 2001 - 18th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. Vol. 2010 Springer Verlag, 2001. pp. 110-120 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{52a7f99849604c68a3e9622d6961820d,
title = "Evasiveness of subgraph containment and related properties",
abstract = "We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks and Sturtevant [4]. For the property of containing a subgraph isomorphic to a fixed graph, and a fairly large class of related n-vertex graph properties, we show evasiveness for an arithmetic progression of values of n. This implies a ½n2 − O(n) lower bound on the decision tree complexity of these properties. We prove that properties that are preserved under taking graph minors are evasive for all sufficiently large n. This greatly generalizes the evasiveness result for planarity [1]. We prove a similar result for bipartite subgraph containment.",
keywords = "Decision tree complexity, Evasiveness, Graph property testing, Monotone graph properties",
author = "Amit Chakrabarti and Subhash Khot and Yaoyun Shi",
year = "2001",
language = "English (US)",
isbn = "9783540416951",
volume = "2010",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "110--120",
booktitle = "STACS 2001 - 18th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings",

}

TY - GEN

T1 - Evasiveness of subgraph containment and related properties

AU - Chakrabarti, Amit

AU - Khot, Subhash

AU - Shi, Yaoyun

PY - 2001

Y1 - 2001

N2 - We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks and Sturtevant [4]. For the property of containing a subgraph isomorphic to a fixed graph, and a fairly large class of related n-vertex graph properties, we show evasiveness for an arithmetic progression of values of n. This implies a ½n2 − O(n) lower bound on the decision tree complexity of these properties. We prove that properties that are preserved under taking graph minors are evasive for all sufficiently large n. This greatly generalizes the evasiveness result for planarity [1]. We prove a similar result for bipartite subgraph containment.

AB - We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks and Sturtevant [4]. For the property of containing a subgraph isomorphic to a fixed graph, and a fairly large class of related n-vertex graph properties, we show evasiveness for an arithmetic progression of values of n. This implies a ½n2 − O(n) lower bound on the decision tree complexity of these properties. We prove that properties that are preserved under taking graph minors are evasive for all sufficiently large n. This greatly generalizes the evasiveness result for planarity [1]. We prove a similar result for bipartite subgraph containment.

KW - Decision tree complexity

KW - Evasiveness

KW - Graph property testing

KW - Monotone graph properties

UR - http://www.scopus.com/inward/record.url?scp=84957090550&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84957090550&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9783540416951

VL - 2010

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 110

EP - 120

BT - STACS 2001 - 18th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings

PB - Springer Verlag

ER -