Sciweavers

6 search results - page 1 / 2
» On the Intersection of Tolerance and Cocomparability Graphs
Sort
View
ISAAC
2010
Springer
268views Algorithms» more  ISAAC 2010»
13 years 2 months ago
On the Intersection of Tolerance and Cocomparability Graphs
It has been conjectured by Golumbic and Monma in 1984 that the intersection of tolerance and cocomparability graphs coincides with bounded tolerance graphs. Since cocomparability g...
George B. Mertzios, Shmuel Zaks
DAM
2007
108views more  DAM 2007»
13 years 4 months ago
3D-interval-filament graphs
: Gavril [GA4] defined two new families of intersection graphs: the interval-filament graphs and the subtree-filament graphs. The complements of intervalfilament graphs are the coi...
Fanica Gavril
DAM
2006
191views more  DAM 2006»
13 years 4 months ago
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
J. Mark Keil, Lorna Stewart
WG
2009
Springer
13 years 11 months ago
A New Intersection Model and Improved Algorithms for Tolerance Graphs
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This class of graphs, which generalizes...
George B. Mertzios, Ignasi Sau, Shmuel Zaks
DAM
2002
91views more  DAM 2002»
13 years 4 months ago
NeST graphs
We establish results on NeST graphs (intersection tolerance graphs of neighborhood subtrees of a tree) and several subclasses. In particular, we show the equivalence of proper NeS...
Ryan B. Hayward, Paul E. Kearney, Andrew J. Malton