An algorithm for constructing edge-trees from hypergraphs (Q3671206)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for constructing edge-trees from hypergraphs |
scientific article; zbMATH DE number 3823838
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for constructing edge-trees from hypergraphs |
scientific article; zbMATH DE number 3823838 |
Statements
An algorithm for constructing edge-trees from hypergraphs (English)
0 references
1983
0 references
edge-tree hypergraph
0 references
polynomial time algorithm
0 references
