An algorithm for constructing edge-trees from hypergraphs (Q3671206): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A recognition algorithm for the intersection graphs of paths in trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3328583 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Transitive Orientation of Graphs and Identification of Permutation Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lectures on matroids / rank | |||
Normal rank | |||
Latest revision as of 10:19, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for constructing edge-trees from hypergraphs |
scientific article |
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
