Results 281 to 290 of about 2,644,664 (312)
Some of the next articles are maybe not open access.
Finding a Maximum Independent Set
SIAM Journal on Computing, 1977We present an algorithm which finds a maximum independent set in an n-vertex graph in 0($2^{n/3}$) time. The algorithm can thus handle graphs roughly three times as large as could be analyzed using a naive algorithm.
Robert Endre Tarjan +1 more
openaire +1 more source
On Independent Sets and Bicliques in Graphs
Algorithmica, 2008Bicliques of graphs have been studied extensively, partially motivated by the large number of applications. In this paper we improve Prisner's upper bound on the number of maximal bicliques [Combinatorica, 2000] and show that the maximum number of maximal bicliques in a graph on $n$ vertices is $\Theta(3^{n/3})$.
Gaspers, Serge +2 more
openaire +3 more sources
On Markov Chains for Independent Sets
Journal of Algorithms, 2000Given a graph \(G\) and a positive number \(\lambda\), a probability distribution \(\pi\) is defined on the class of independent sets \(x\) in \(G\) by taking the probability of \(x\) proportional the \(\lambda\) raised to the size of \(x\). Various Markov chains are considered with the class of independent sets as its state space and the probability ...
Martin E. Dyer, Catherine S. Greenhill
openaire +1 more source
An Independence Relation for Sets of Secrets
Studia Logica, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sara Miner More, Pavel Naumov
openaire +3 more sources
Facets of the independent set polytope
Mathematical Programming, 2003The independent set polytope \(\text{ISP}= \{x\mid Ax\leq b,\, x\in\{0,1\}\}\) yields a hypergraph \(H\), containing \(V= \{1,\dots,n\}\) as vertices and a hyperedge \(eCV\) if and only if \(\sum_{j\in e} a_{ij}> b_i\) for some \(i\). If all edges have exactly \(k\) vertices, the hypergraph is an \(k\)-hypergraph \(H_k\). A hyperclique \(K_{m,k}\) in \(
Todd Easton, Kevin Hooker, Eva K. Lee
openaire +1 more source
1999
Abstract A subset S ⊆V in a TS(v, λ) (V,B)is independentif B ⊈Sfor all BE B.An independent set is maximalif, for all x∈ V\ S, S⋃ ( x) is not independent (that is, it is maximal with respect to set inclusion). It is maximumif it has the largest cardinality of any independent set in the design.
Charles J Colbourn, Alexander Rosa
openaire +1 more source
Abstract A subset S ⊆V in a TS(v, λ) (V,B)is independentif B ⊈Sfor all BE B.An independent set is maximalif, for all x∈ V\ S, S⋃ ( x) is not independent (that is, it is maximal with respect to set inclusion). It is maximumif it has the largest cardinality of any independent set in the design.
Charles J Colbourn, Alexander Rosa
openaire +1 more source
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
UNIONS OF PRODUCTS OF INDEPENDENT SETS
Real Analysis Exchange, 1993Summary: We show that there exists an open set \(H\subseteq [0, 1]\times [0, 1]\) with full two-dimensional Lebesgue measure \(\lambda_ 2(H)= 1\) such that for any \(\varepsilon> 0\) there exists a set \(E\) satisfying \(\lambda_ 1(E)> {1\over 2}- \varepsilon\) and \(H\) contains the product set \(E\times E\) but there is no set \(S\) with \(\lambda_ 1(
openaire +2 more sources
On fuzzy independence set systems
Fuzzy Sets and Systems, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
How valuable are independent directors? Evidence from external distractions
Journal of Financial Economics, 2019Ronald W Masulis, Emma Jincheng Zhang
exaly