Results 1  10
of
4,001,605
Maximum Independent Set of Rectangles
"... We study the Maximum Independent Set of Rectangles (MISR) problem: given a collection R of n axisparallel rectangles, find a maximumcardinality subset of disjoint rectangles. MISR is a special case of the classical Maximum Independent Set problem, where the input is restricted to intersection grap ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
We study the Maximum Independent Set of Rectangles (MISR) problem: given a collection R of n axisparallel rectangles, find a maximumcardinality subset of disjoint rectangles. MISR is a special case of the classical Maximum Independent Set problem, where the input is restricted to intersection
THE STRUCTURE OF MAXIMUM INDEPENDENT SETS IN FULLERENES
"... Abstract. A fullerene is a trivalent (valency three), convex polyhedron with only convex pentagonal and convex hexagonal faces. The graph theoretic independence number of fullerenes may be a useful predictor for stability in chemistry. We explore the independence number of fullerenes by exploring t ..."
Abstract
 Add to MetaCart
the structure of two maximum independent sets and an independent edge set. We will see that certain pairings of pentagons result in maximum independent sets, and that these pairings can be used to compute the independence number of icosahedral fullerenes.
ON THE NUMBER OF MAXIMUM INDEPENDENT SETS OF GRAPHS
, 2014
"... Abstract. Let G be a simple graph. An independent set is a set of pairwise nonadjacent vertices. The number of vertices in a maximum independent set of G is denoted by α(G). In this paper, we characterize graphs G with n vertices and with maximum number of maximum independent sets provided that α( ..."
Abstract
 Add to MetaCart
Abstract. Let G be a simple graph. An independent set is a set of pairwise nonadjacent vertices. The number of vertices in a maximum independent set of G is denoted by α(G). In this paper, we characterize graphs G with n vertices and with maximum number of maximum independent sets provided that α
Exact algorithms for maximum independent set
 In ISAAC
, 2013
"... Abstract The maximum independent set problem is a basic NPhard problem and has been extensively studied in exact algorithms. The maximum independent set problems in lowdegree graphs are also important and may be bottlenecks of the problem in general graphs. In this paper, we present an O * (1.173 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract The maximum independent set problem is a basic NPhard problem and has been extensively studied in exact algorithms. The maximum independent set problems in lowdegree graphs are also important and may be bottlenecks of the problem in general graphs. In this paper, we present an O * (1
Approximating Maximum Independent Sets by Excluding Subgraphs
 BIT
, 1992
"... An approximation algorithm for the maximum independent set problem is given, improving the best performance guarantee known to O(n/(log n)²). We also obtain the same performance guarantee for graph coloring. The results can be combined into a surprisingly strong simultaneous performance guarantee ..."
Abstract

Cited by 141 (11 self)
 Add to MetaCart
An approximation algorithm for the maximum independent set problem is given, improving the best performance guarantee known to O(n/(log n)²). We also obtain the same performance guarantee for graph coloring. The results can be combined into a surprisingly strong simultaneous performance
The number of maximum independent sets in graphs
 Taiwanese J. Math
, 2000
"... Abstract. In this paper, we study the problem of determining the largest number of maximum independent sets of a graph of order n. Solutions to this problem are given for various classes of graphs, including general graphs, trees, forests, (connected) graphs with at most one cycle, connected graphs ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Abstract. In this paper, we study the problem of determining the largest number of maximum independent sets of a graph of order n. Solutions to this problem are given for various classes of graphs, including general graphs, trees, forests, (connected) graphs with at most one cycle, connected graphs
Maximum Independent Sets in Certain Powers of Odd Cycles
, 2008
"... Abstract We give a complete classification of all maximum independent sets in powers of oddcycles of the form Cdk2d+1. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract We give a complete classification of all maximum independent sets in powers of oddcycles of the form Cdk2d+1.
An Evolutionary Heuristic for the Maximum Independent Set Problem
 IN PROCEEDINGS OF THE FIRST IEEE CONFERENCE ON EVOLUTIONARY COMPUTATION
, 1994
"... The results obtained from the application of a genetic algorithm, GENEsYs, to the NPcomplete maximum independent set problem are reported in this work. In contrast to many other genetic algorithm based approaches that use domainspecific knowledge, the approach presented here relies on a graded pen ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
The results obtained from the application of a genetic algorithm, GENEsYs, to the NPcomplete maximum independent set problem are reported in this work. In contrast to many other genetic algorithm based approaches that use domainspecific knowledge, the approach presented here relies on a graded
Approximation Algorithms for Maximum Independent Set of PseudoDisks
, 2008
"... We present approximation algorithms for maximum independent set of pseudodisks in the plane, both in the weighted and unweighted cases. For the unweighted case, we prove that a local search algorithm yields a PTAS. For the weighted case, we suggest a novel rounding scheme based on an LP relaxation ..."
Abstract

Cited by 20 (3 self)
 Add to MetaCart
We present approximation algorithms for maximum independent set of pseudodisks in the plane, both in the weighted and unweighted cases. For the unweighted case, we prove that a local search algorithm yields a PTAS. For the weighted case, we suggest a novel rounding scheme based on an LP relaxation
ONLINE MAXIMUM INDEPENDENT SET IN CHORDAL GRAPHS
"... In this paper we deal with the online maximum independent set and we propose a probabilistic O(log n)competitive algorithm for chordal and interval graphs, proving that the same ratio is a lower bound of the problem. The relation of the online maximum independent set with the online admission co ..."
Abstract
 Add to MetaCart
In this paper we deal with the online maximum independent set and we propose a probabilistic O(log n)competitive algorithm for chordal and interval graphs, proving that the same ratio is a lower bound of the problem. The relation of the online maximum independent set with the online admission
Results 1  10
of
4,001,605