Recognizing random intersection graphs (Q1587611): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Latest revision as of 05:00, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Recognizing random intersection graphs |
scientific article |
Statements
Recognizing random intersection graphs (English)
0 references
9 November 2001
0 references
For a hypergraph \(H=(V,E)\) the \(l\)-intersection graph \(\Omega_l(H)\) has the vertex set \(E\) and two of its vertices are adjacent if the corresponding edges of \(H\) have at least \(l\) common elements. The author designs a polynomial-time algorithm that reconstructs a simple \(k\)-uniform hypergraph from its \(l\)-intersection graph for a class of random \(k\)-uniform hypergraphs. He also presents two algorithms for reconstructing almost every random graph from its related hypergraphs.
0 references
intersection graphs
0 references
random graphs
0 references