Maximum independent set and maximum clique algorithms for overlap graphs
type: Item
instance of: scholarly article
title: Maximum independent set and maximum clique algorithms for overlap graphs
zbMATH Open document ID: 1022.05081
DOI: 10.1016/S0166-218X(02)00418-3
published in: Discrete Applied Mathematics
publication date: 2003-09-25T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1985919
zbMATH Keywords: overlap graphs
zbMATH Keywords: independent set
zbMATH Keywords: clique
zbMATH Keywords: algorithm
zbMATH Keywords: subtrees in a tree
zbMATH Keywords: subtree overlap graphs
author: Eowyn Cenek
author: Lorna Stewart
MaRDI profile type: Publication
cites work: Q4873786
cites work: Graph Classes: A Survey
cites work: Partially Ordered Sets
cites work: Q4093489
cites work: Algorithms for a maximum clique and a maximum independent set of a circle graph
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: Maximum weight independent sets and cliques in intersection graphs of filaments
cites work: Q3328583
cites work: Containment Graphs, Posets, and Related Classes of Graphs
cites work: Polynomial time algorithms on circular-arc overlap graphs
cites work: Q3201076
cites work: Q4027165
cites work: Covering and coloring polygon-circle graphs
cites work: Arbres et dimension des ordres
cites work: Sur deux propriétés des classes d'ensembles
cites work: The max clique problem in classes of string-graphs
cites work: On rectangle intersection and overlap graphs
cites work: Algorithmic Aspects of Vertex Elimination on Graphs
cites work: Characterizing intersection classes of graphs
cites work: A study on two geometric location problems
description: scientific article; zbMATH DE number 1985919