Results 271 to 280 of about 10,268,798 (293)
Some of the next articles are maybe not open access.

Coloring and Maximum Independent Set of Rectangles

2011
In this paper, we consider two geometric optimization problems: Rectangle Coloring problem (RCOL) and Maximum Independent Set of Rectangles (MISR). In RCOL, we are given a collection of n rectangles in the plane where overlapping rectangles need to be colored differently, and the goal is to find a coloring using minimum number of colors.
openaire   +1 more source

The maximum number of maximum generalized 4‐independent sets in trees

Journal of Graph Theory
AbstractA generalized ‐independent set is a set of vertices such that the induced subgraph contains no trees with ‐vertices, and the generalized ‐independence number is the cardinality of a maximum ‐independent set in . Zito proved that the maximum number of maximum generalized 2‐independent sets in a tree of order is if is odd, and if is even. Tu
Pingshan Li, Min Xu
openaire   +1 more source

Neural Maximum Independent Set

2021
Thomas Pontoizeau   +3 more
openaire   +2 more sources

On Reducing Maximum Independent Set to Minimum Satisfiability

2014
Maximum Independent Set (MIS) is a well-known NP-hard graph problem, tightly related with other well known NP-hard graph problems, namely Minimum Vertex Cover (MVC) and Maximum Clique (MaxClq). This paper introduces a novel reduction of MIS into Minimum Satisfiability (MinSAT), thus, providing an alternative approach for solving MIS.
Alexey Ignatiev   +2 more
openaire   +2 more sources

On the maximum number of maximum independent sets in connected graphs

Journal of Graph Theory, 2021
Dieter Rautenbach
exaly  

Applications of maximum independent set

AIP Conference Proceedings, 2022
Abbas Musleh Salman   +1 more
openaire   +1 more source

Polynomial-time Algorithm for Maximum Weight Independent Set on P 6 -free Graphs

ACM Transactions on Algorithms, 2022
Marcin Pilipczuk   +2 more
exaly  

Critical and Maximum Independent Sets Revisited

2019
Vadim E. Levit, Eugen Mandrescu
openaire   +1 more source

A note on greedy algorithms for the maximum weighted independent set problem

Discrete Applied Mathematics, 2003
Koichi Yamazaki, Shuichi Sakai
exaly  

Using critical sets to solve the maximum independent set problem

Operations Research Letters, 2007
Sergiy Butenko
exaly  

Home - About - Disclaimer - Privacy