Results 11 to 20 of about 996,556 (196)
Exact algorithms for maximum independent set [PDF]
Information and Computation, 2013 We show that the maximum independent set problem (MIS) on an $n$-vertex graph can be solved in $1.1996^nn^{O(1)}$ time and polynomial space, which even is faster than Robson's $1.2109^{n}n^{O(1)}$-time exponential-space algorithm published in 1986. We also obtain improved algorithms for MIS in graphs with maximum degree 6 and 7, which run in time of $1.
Mingyu Xiao 0001, Hiroshi Nagamochi
openaire +4 more sources
On Sequential Heuristic Methods for the Maximum Independent Set Problem
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
Learning-augmented Maximum Independent Set [PDF]
CoRRWe study the Maximum Independent Set (MIS) problem on general graphs within the framework of learning-augmented algorithms. The MIS problem is known to be NP-hard and is also NP-hard to approximate to within a factor of $n^{1-δ}$ for any $δ>0$. We show that we can break this barrier in the presence of an oracle obtained through predictions from a ...
Vladimir Braverman +3 more
core +6 more sources
Data aggregation scheduling algorithm based on twice maximum independent set [PDF]
Tongxin xuebao, 2014 The main task in designing a data aggregation schedule was to get a good trade-off between QoS and weighted fairness guarantee.In order to address this problem,a novel data aggregation scheduling algorithm,MISS,was proposed,which could produce a ...
Jian XU +4 more
doaj +4 more sources
The Maximum Independent Set Problem [PDF]
, 2018 Το πρόβλημα του μέγιστου ανεξάρτητου συνόλου, που πρόκειται για την εύρεση ενός μέγιστου συνόλου κόμβων ενός γράφου δεδομένων, τέτοιο ώστε να μην υπάρχει καμία ακμή μεταξύ οποιονδήποτε δυο κόμβων εντός του συνόλου, είναι ένα από τα βασικά NP-hard προβλήματα βελτιστοποίησης και έχει ερευνηθεί εκτενώς εντός της βιβλιογραφίας, συγκεκριμένα στο ερευνητικό ...
ΠΑΠΑΤΣΩΡΗΣ ΙΩΑΝΝΗΣ +1 more
openaire +2 more sources
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
Online Maximum Independent Set of Hyperrectangles
CoRR, 2023 29 pages, 17 ...
Rishi Advani, Abolfazl Asudeh
openaire +2 more sources
Spanning k-Ended Tree in 2-Connected Graph
Axioms, 2023 Win proved a very famous conclusion that states the graph G with connectivity κ(G), independence number α(G) and α(G)≤κ(G)+k−1(k≥2) contains a spanning k-ended tree. This means that there exists a spanning tree with at most k leaves.
Wanpeng Lei, Jun Yin
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 +2 more sources
Tạp chí Khoa học Đại học Đà Lạt, 2021 Let \(G\) be an undirected simple graph on n vertices and \(\sigma^2(G)=n-2\) (degree sum of any two non-adjacent vertices in \(G\) is equal to \(n-2\)) and \(\alpha(G)\) be the cardinality of an maximum independent set of \(G\).
Do Nhu An
doaj +1 more source