Results 11 to 20 of about 10,268,798 (293)
On Sequential Heuristic Methods for the Maximum Independent Set Problem [PDF]
Discussiones Mathematicae Graph Theory, 2017 We consider sequential heuristics methods for the Maximum Independent Set (MIS) problem. Three classical algorithms, VO [11], MIN [12], or MAX [6] , are revisited. We combine Algorithm MIN with the α-redundant vertex technique[3].
Lê Ngoc C. +2 more
doaj +3 more sources
From Maximum Cut to Maximum Independent Set
The Maximum Cut (Max-Cut) problem could be naturally expressed either in a Quadratic Unconstrained Binary Optimization (QUBO) formulation, or as an Ising model. It has long been known that the Maximum Independent Set (MIS) problem could also be related to a specific Ising model.
Wu, Chuixiong, Wang, Jianan, Zuo, Fen
openaire +3 more sources
The Maximum Independent Set Problem [PDF]
, 2018 Το πρόβλημα του μέγιστου ανεξάρτητου συνόλου, που πρόκειται για την εύρεση ενός μέγιστου συνόλου κόμβων ενός γράφου δεδομένων, τέτοιο ώστε να μην υπάρχει καμία ακμή μεταξύ οποιονδήποτε δυο κόμβων εντός του συνόλου, είναι ένα από τα βασικά NP-hard προβλήματα βελτιστοποίησης και έχει ερευνηθεί εκτενώς εντός της βιβλιογραφίας, συγκεκριμένα στο ερευνητικό ...
ΠΑΠΑΤΣΩΡΗΣ ΙΩΑΝΝΗΣ +1 more
core +3 more sources
A faster algorithm for maximum independent set on interval filament graphs
Journal of Graph Algorithms and Applications, 2022 We provide an algorithm requiring only $O(N^2)$ time to compute the maximum weight independent set in an $N$-vertex interval filament graph. This implies an $O(N^4)$-time algorithm to compute the maximum weight induced matching in such graphs.
Darcy Best, Max Ward
doaj +1 more source
BEYOND MAXIMUM INDEPENDENT SET: AN EXTENDED MODEL FOR POINT-FEATURE LABEL PLACEMENT [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2016 Map labeling is a classical problem of cartography that has frequently been approached by combinatorial optimization. Given a set of features in the map and for each feature a set of label candidates, a common problem is to select an independent set of ...
J.-H. Haunert, A. Wolff
doaj +1 more source
IEEE Access, 2023 Correlation-diversified portfolios can be constructed by finding the maximum independent sets (MISs) in market graphs with edges corresponding to correlations between two stocks.
Ryo Hidaka +3 more
doaj +1 more source
On Approximating Maximum Independent Set of Rectangles [PDF]
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), 2016 We study the Maximum Independent Set of Rectangles (MISR) problem: given a set of $n$ axis-parallel rectangles, find a largest-cardinality subset of the rectangles, such that no two of them overlap. MISR is a basic geometric optimization problem with many applications, that has been studied extensively.
Julia Chuzhoy, Alina Ene
openaire +3 more sources
Scalable Kernelization for Maximum Independent Sets [PDF]
ACM Journal of Experimental Algorithmics, 2018 The most efficient algorithms for finding maximum independent sets in both theory and practice use reduction rules to obtain a much smaller problem instance called a kernel . The kernel can then be solved quickly using exact or heuristic algorithms—or by repeatedly kernelizing recursively in the branch-and-reduce ...
Demian Hespe +2 more
openaire +10 more sources
Online Maximum Independent Set of Hyperrectangles
CoRR, 2023 29 pages, 17 ...
Rishi Advani, Abolfazl Asudeh
openaire +3 more sources
On the maximum number of maximum independent sets in connected graphs [PDF]
Journal of Graph Theory, 2020 AbstractWe characterize the connected graphs of given order and given independence number that maximize the number of maximum independent sets. For , there is a unique such graph that arises from the disjoint union of cliques of orders and , which is the complement of a Turán graph, by selecting a vertex in a largest clique and adding an edge ...
Elena Mohr, Dieter Rautenbach
openaire +4 more sources