A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
A (k, r)-tuple is a word of length r on an alphabet of size k. A graph is (k, r)-representable if we can assign a (k, r)-tuple to each vertex such that two vertices are connected iff the associated tuples agree on some component. We study the complexity of several graph problems on (k, r)-representable graphs, as a function of the parameters k, r; the problems under study are Maximum Independent Set, Minimum Dominating Set and Maximum Clique. In this framework, there are two classes ofdoi:10.1007/11940128_27 fatcat:uh23e23abnhhpkbfzmnvuxsejy