A New Characterization of Graphs Based on Interception Relations

Journal of Graph Theory

Volumn 22, Issue 2, 1996, Pages 125-136

  Paz, Azaria ^a   Pearl, Judea ^b   Ur, Shmuel ^c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030558399     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199606)22:2<125::AID-JGT3>3.0.CO;2-P     Document Type: Article

References (6)

1. M. R. Garey and D. S. Jonson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co, San Francisco (1979).
2. V. Isham, An introduction to spatial point processes and Markov random fields. Intl. Statist. Rev. 49 (1981) 21-43.
3. S. L. Lauritzen, Lectures on Contingency Tables, 2nd Edition, University of Aalborg Press, Aalborg, Denmark (1982).
4. J. Pearl, Probabilistic Reasoning in Intelligent Systems. Morgan Kaufman Publishers, San Mateo, CA (1988).
5. Shang-Hua Teng, CMU-CS-91-184 Report, August (1991).
6. W. T. Tutte, Connectivity in Graphs. Oxford University Press, London (1966).