An algorithm for constructing edge-trees from hypergraphs

DOI10.1002/NET.3230130306zbMATH Open0521.05049OpenAlexW1977216722MaRDI QIDQ3671206FDOQ3671206

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

• Title not available (Why is that?)
• Lectures on matroids
• Transitive Orientation of Graphs and Identification of Permutation Graphs
• A recognition algorithm for the intersection graphs of paths in trees

Cited In (2)

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

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)