Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Computing and Combinatorics: First Annual International Conference, COCOON ' 95, Xi' an, China, August 24-26, 1995. Proceedings > Non-empty cross-3-intersection theorems of subsets
Computing and Combinatorics: First Annual International Conference, COCOON ' 95, Xi' an, China, August 24-26, 1995. Proceedings |
Ding-Zhu Du; Ming Li
Springer Berlin Heidelberg
Computing and Combinatorics: First Annual International Conference, COCOON ' 95, Xi' an, China, August 24-26, 1995. Proceedings
Non-empty cross-3-intersection theorems of subsets
Authors

Shiquan Wu

ARI Id

1664938410335_4149758

Access

Not Available Free

Pages

350-356

DOI

10.1007/BFb0030850

Chapter URL

https://rd.springer.com/chapter/10.1007/BFb0030850

Table of Contents of Book
Showing 1 to 20 of 79 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
The complexity of mean payoff games
Uri Zwick; Michael S. Paterson
1-10
Approximation of coNP sets by NP-complete sets
Kazuo Iwama; Shuichi Miyazaki
11-20
How to draw a planar clustered graph
Qing -Wen Feng; Robert F. Cohen; Peter Eades
21-30
An efficient orthogonal grid drawing algorithm for cubic graphs
Tiziana Calamoneri; Rossella Petreschi
31-40
Constrained independence system and triangulations of planar point sets
Siu-Wing Chengl; Yin-Feng Xu
41-50
Three dimensional weak visibility: Complexity and applications
Caoan Wang; Binhai Zhu
51-60
Rectangulating rectilinear polygons in parallel
Sung Kwon Kim
61-70
Efficient randomized incremental algorithm for the closest pair problem using Leafary trees
V. Kamakoti; Kamala Krithivasan; C. Pandu Rangan
71-80
Testing containment of object-oriented conjunctive queries is ∏ 2 p -hard
Edward P. F. Chan; Ron van der Meyden
81-90
Computing infinite relations using finite expressions: A new approach to the safety issue in relational databases
Ruogu Zhang
91-100
Set-term unification in a logic database language
Seung Jin Lim; Yiu-Kai Ng
101-110
Computations with finite closure systems and implications
Marcel Wild
111-120
Maximum tree-packing in time O(n5/2)
Andrzej Lingas
121-130
Optimal algorithms for finding connected components of an unknown graph
Weiping Shi; Douglas B. West
131-140
The multi-weighted spanning tree problem
Joseph L. Ganley; Mordecai J. Golin; Jeffrey S. Salowe
141-150
Algorithmic graph embeddings
Jianer Chen
151-160
Analysis of quorum-based protocols for distributed (k+1)-exclusion
Divyakant Agrawal; Ömer Eğecioğlu; Amr El Abbadi
161-170
A highly fault-tolerant quorum consensus method for managing replicated data
Xuemin Lin; Maria E. Orlowska
171-180
Constructing Craig interpolation formulas
Guoxiang Huang
181-190
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 79 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings