An algorithm for constructing edge-trees from hypergraphs

DOI10.1002/net.3230130306zbMath0521.05049OpenAlexW1977216722MaRDI QIDQ3671206

Fanica Gavril, Robert Tamari

Publication date: 1983

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230130306

zbMATH Keywords

polynomial time algorithmedge-tree hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Algorithms in computer science (68W99)

Related Items (2)

Intersection graphs of paths in a tree ⋮ Algorithmic aspects of intersection graphs and representation hypergraphs

Cites Work

• Unnamed Item
• A recognition algorithm for the intersection graphs of paths in trees
• Lectures on matroids
• Transitive Orientation of Graphs and Identification of Permutation Graphs

This page was built for publication: An algorithm for constructing edge-trees from hypergraphs