Maximum colorful independent sets in vertex-colored graphs

Yannis Manoussakis; Hong-Phong Pham

Conference Poster Year : 2018

Maximum colorful independent sets in vertex-colored graphs

(1) , (1)

1

Yannis Manoussakis

Function : Author
PersonId : 3010
IdHAL : yannis-manoussakis
IdRef : 032916604

Graphes, Algorithmes et Combinatoire (LRI)

Hong-Phong Pham

Function : Author

Graphes, Algorithmes et Combinatoire (LRI)

Keywords

graphs colors tropical veretx-colored independent set

Domains

Computer Science [cs] Computational Complexity [cs.CC] Computer Science [cs] Discrete Mathematics [cs.DM] Computer Science [cs] Data Structures and Algorithms [cs.DS]

Yannis Manoussakis : Connect in order to contact the contributor

https://hal.science/hal-01827900

Submitted on : Monday, July 2, 2018-6:59:52 PM

Last modification on : Friday, March 24, 2023-2:53:07 PM

Dates and versions

hal-01827900 , version 1 (02-07-2018)

Identifiers

HAL Id : hal-01827900 , version 1

Cite

Yannis Manoussakis, Hong-Phong Pham. Maximum colorful independent sets in vertex-colored graphs. DMD2018, Jun 2018, Sevilla, Spain. 2018. ⟨hal-01827900⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

CNRS UMR8623 CENTRALESUPELEC LRI-GALAC TDS-MACS UNIV-PARIS-SACLAY LISN GS-ENGINEERING GS-COMPUTER-SCIENCE LISN-GALAC

86 View

0 Download

Maximum colorful independent sets in vertex-colored graphs

Keywords

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Share