<--- Back to Details
First PageDocument Content
Clique / Tree decomposition / Vertex separator / Connectivity / Graph / NP-complete problems / Path decomposition / Planar separator theorem / Graph theory / Graph operations / Chordal graph
Date: 2000-10-25 12:01:29
Clique
Tree decomposition
Vertex separator
Connectivity
Graph
NP-complete problems
Path decomposition
Planar separator theorem
Graph theory
Graph operations
Chordal graph

Bounds for cell entries in contingency tables given marginal totals and decomposable graphs Adrian Dobra and Stephen E. Fienberg* Department of Statistics and Center for Automated Learning and Discovery, Carnegie Mellon

Document is deleted from original location.
Use the Download Button below to download from the Web Archive.

Download Document from Web Archive

File Size: 144,96 KB