Results 171 to 180 of about 996,556 (196)
Some of the next articles are maybe not open access.
Algorithms for maximum independent sets
Journal of Algorithms, 1986Summary: An algorithm is presented which finds (the size of) a maximum independent set of an n vertex graph in time \(O(2^{0.276n})\) improving on a previous bound of \(O(2^{n/3})\). The improvement comes principally from three sources: first, a modified recursive algorithm based on a more detailed study of the possible subgraphs around a chosen vertex:
openaire +2 more sources
On the Maximum Independent Set Problem in Graphs of Bounded Maximum Degree
Acta Mathematica Vietnamica, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ngoc C. Lê, Trung Tran
openaire +1 more source
The structure and maximum number of maximum independent sets in trees
Journal of Graph Theory, 1991AbstractA subset of vertices is a maximum independent set if no two of the vertices are joined by an edge and the subset has maximum cardinality. in this paper we answer a question posed by Herb Wilf. We show that the greatest number of maximum independent sets for a tree of n vertices ismagnified imageWe give the families of trees on which these ...
openaire +2 more sources
The maximum number of maximum generalized 4‐independent sets in trees
Journal of Graph TheoryAbstractA 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
Coloring and Maximum Independent Set of Rectangles
2011In 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
Heuristics to Find Maximum Independent Set: An Overview
2012The maximum independent set problem (MISP) is to find the largest subset of vertices of a graph such that none of these vertices are connected by an edge (i.e., all vertices are independent of each other). It has many real life applications. In solving MISP, especially where the complexity of the graph increases, exact methods become impractical or ...
Kedar Nath Das, Biplab Chaudhuri
openaire +1 more source
Maximum Independent Set of Links with Power Control
2013This paper addresses the joint selection and power assignment of a largest number of given links which can communicate successfully at the same time under the physical interference model. For this optimization problem, we present a constant-approximation algorithm with improved performance over existing approximation algorithms.
Chao Ma, Fahad Al-dhelaan, Peng-Jun Wan
openaire +1 more source
Polynomial-time Algorithm for Maximum Weight Independent Set on P 6 -free Graphs
ACM Transactions on Algorithms, 2022Andrzej Grzesik +2 more
exaly
On the maximum number of maximum independent sets in connected graphs
Journal of Graph Theory, 2021Dieter Rautenbach
exaly