نتایج جستجو برای: robust coloring problem
تعداد نتایج: 1064111 فیلتر نتایج به سال:
Journal:
:Discrete Applied Mathematics
2012
Journal:
:Journal of Graph Algorithms and Applications
2015
Journal:
:Journal of Mathematics and Computer Science
2011
Journal:
:Optimization Letters
2010
Balabhaskar Balasundaram
Shyam Sundar Chandramouli
Svyatoslav Trukhanov
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex problem on unit-disk graphs. The related problem of minimum co-k-plex coloring that generalizes classical vertex coloring is also studied in the context of unit-disk graphs. We extend several classical approximation results...
Journal:
:Revista de Informática Teórica e Aplicada
2018
Journal:
:Journal of Combinatorial Optimization
2009
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید