"Generating the fewest redundancy-free scheme trees from acyclic ..."

Wai Yin Mok, Joseph Fong, David W. Embley (2014)

> Home

Details and statistics

DOI: 10.1016/J.IS.2013.10.009

access: closed

type: Journal Article

metadata version: 2017-05-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/is/MokFE14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/is/MokFE14
Wai Yin Mok, Joseph Fong, David W. Embley:
Generating the fewest redundancy-free scheme trees from acyclic conceptual-model hypergraphs in polynomial time. Inf. Syst. 41: 20-44 (2014)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.