✦ LIBER ✦

On the sensitivity complexity of bipartite graph properties

✍ Scribed by Gao, Yihan; Mao, Jieming; Sun, Xiaoming; Zuo, Song

Book ID: 119375431
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 342 KB
Volume: 468
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.11.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved lower bound on the sensitivi

An improved lower bound on the sensitivity complexity of graph properties

✍ Xiaoming Sun 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 313 KB

On factorial properties of chordal bipar

On factorial properties of chordal bipartite graphs

✍ Konrad Dabrowski; Vadim V. Lozin; Victor Zamaraev 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 256 KB

On the recognition complexity of some gr

On the recognition complexity of some graph properties

✍ Eberhard Triesch 📂 Article 📅 1996 🏛 Springer-Verlag 🌐 English ⚖ 487 KB

On the bipartition of graphs

✍ Peter Buser 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 309 KB

The critical complexity of graph propert

The critical complexity of graph properties

✍ György Turán 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 227 KB

On the bipartite independence number of

On the bipartite independence number of a balanced bipartite graph

✍ Odile Favaron; Pedro Mago; Oscar Ordaz 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 603 KB

Venezuela Ap. 47567, Caracas Favaron, O., P. Mago and 0. Ordaz, On the bipartite independence number of a balanced bipartite graph, Discrete Mathematics 121 (1993) 55-63. The bipartite independence number GI aIp of a bipartite graph G is the maximum order of a balanced independent set of G. Let 6 b