Max-tolerance graphs as intersection graphs
From MaRDI portal
Publication:3581555
DOI10.1145/1109557.1109649zbMath1192.05102MaRDI QIDQ3581555
Michael Kaufmann, Jan Kratochvíl, Amarendran R. Subramanian, Katharina A. Zweig
Publication date: 16 August 2010
Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1109557.1109649
68R10: Graph theory (including graph drawing) in computer science
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
On central max-point-tolerance graphs, Homothetic triangle representations of planar graphs, Intersection graphs of homothetic polygons, The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial, Computing list homomorphisms in geometric intersection graphs, Max point-tolerance graphs, Homothetic polygons and beyond: maximal cliques in intersection graphs, Co-bipartite neighborhood edge elimination orderings, The partial order competition dimensions of bipartite graphs, An intersection model for multitolerance graphs: efficient algorithms and hierarchy, A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs, New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs
Uses Software
