An O( n3) time algorithm for recognizing threshold dimension 2 graphs

Threshold dimension 2 graphs are the (edge-)intersection of two threshold graphs T 1 and T 2. Moreover they are the intersection graphs of points, axially parallel line segments and rectangles in the first quadrant of the Euclidean plane subject to the following constraints: 1. (1) line segments hav...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information processing letters 1998-09, Vol.67 (5), p.255-259
Hauptverfasser:	Sterbini, Andrea, Raschle, Thomas
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer science control theory systems Exact sciences and technology Graphs Information processing Information retrieval. Graph Maximum cliques Studies Theoretical computing Threshold dimension 2 graphs
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!