Algorithmic aspects of intersection graphs and representation hypergraphs
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.
scientific article; zbMATH DE number 4097411
scientific article