On-Line Maximum-Order Induces Hereditary Subgraph Problems

Authors:
Marc Demange;Xavier Paradon;Vangelis Th. Paschos
Affiliations:
-;-;-
Venue:
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Year:
2000

Citing 1
Cited 1

Approximating maximum independent sets by excluding subgraphs

BIT

Algorithms and Models for the On-Line Vertex-Covering

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We first study the competitivity ratio for the on-line version of the problem of finding a maximum-order induced subgraph satisfying some hereditary property, under the hypothesis that the input graph is revealed by clusters. Then, we focus ourselves on two of the most known instantiations of this problem, the maximum independent set and the maximum clique.