On-line maximum-order induced hereditary subgraph problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1963, Issue , 2000, Pages 327-335

  Demange, Marc ^a   Paradon, Xavier ^b   Th Paschos, Vangelis ^b  

^a UNIVERSITÉ PARIS 1 PANTHÉON SORBONNE   (France)

^b UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

COMPETITIVITY; HEREDITARY PROPERTY; HEREDITARY SUBGRAPH PROBLEMS; INDUCED SUBGRAPHS; INPUT GRAPHS; MAXIMUM CLIQUE; MAXIMUM INDEPENDENT SETS; ONLINE VERSIONS;

ARTIFICIAL INTELLIGENCE;

EID: 84956975150     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44411-4_21     Document Type: Conference Paper

References (4)

1. Boppana, B. B., Halldórsson, M. M.: Approximating maximum independent sets by excluding subgraphs. BIT 32(2)(1992) 180–196.
2. Demange, M., Paschos, V. Th.: Maximum-weight independent set is as “wellapproximated” as the unweighted one. Technical Report 163(1999) LAMSADE, Université Paris-Dauphine.
3. Demange, M., Paradon, X., Paschos, V. Th.: On-line maximum-order induced hereditary subgraph problems. Research Note 25(2000) LAMSADE, Université Paris-Dauphine.
4. Halldórsson, M. M.: Approximations via partitioning. JAIST Research Report ISRR-95-0003F(1995) Japan Advanced Institute of Science and Technology, Japan.