Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithmic aspects of intersection graphs and representation hypergraphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic aspects of intersection graphs and representation hypergraphs |
scientific article |
Statements
Algorithmic aspects of intersection graphs and representation hypergraphs (English)
0 references
1988
0 references
This paper presents a survey about algorithms for common graph theory questions for different classes of intersection graphs. A graph is an intersection graph if there is a one-to-one correspondence between its vertices and a family of sets (intervals on the line, boxes in n-space, etc.) such that two vertices are adjacent if and only if the corresponding objects overlap. Some equivalences of problems are given and some problems are restated in hypergraph terminology.
0 references
intersection graphs
0 references
0 references
0 references
0 references
0 references
0 references
