An algorithm for constructing edge-trees from hypergraphs

DOI10.1002/NET.3230130306MaRDI QIDQ3671206zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• A recognition algorithm for the intersection graphs of paths in trees
• Lectures on matroids
• Transitive Orientation of Graphs and Identification of Permutation Graphs

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3671206)