Studies on hypergraphs. I: Hyperforests
From MaRDI portal
Publication:1209154
DOI10.1016/0166-218X(93)90182-NzbMATH Open0774.05074OpenAlexW2008378479WikidataQ126353017 ScholiaQ126353017MaRDI QIDQ1209154FDOQ1209154
Publication date: 16 May 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(93)90182-n
Cites Work
- Incidence matrices and interval graphs
- Complexity of Finding Embeddings in a k-Tree
- On rigid circuit graphs
- Triangulated graphs and the elimination process
- On the Desirability of Acyclic Database Schemes
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Markov fields and log-linear interaction models for contingency tables
- Contribution to nonserial dynamic programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (4)
Recommendations
This page was built for publication: Studies on hypergraphs. I: Hyperforests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1209154)