Results 271 to 280 of about 13,294,177 (308)

Stochastic Independence in a Coherent Setting

Annals of Mathematics and Artificial Intelligence, 2002
The authors continue their systematic study of coherent assessment of (finitely additive) probability to a family of conditional events. They start with a nice exposition of the concept of coherent assessment and then thoroughly study the stochastic independence in the framework of coherent probability theory.
COLETTI, Giulianella, Scozzafava R.
openaire   +3 more sources

On Independent Sets and Bicliques in Graphs

Algorithmica, 2008
Bicliques 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, Kratsch, Dieter, Liedloff, Mathieu   +2 more
openaire   +3 more sources

Finding a Maximum Independent Set

SIAM Journal on Computing, 1977
We 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, Anthony E. Trojanowski   +1 more
openaire   +1 more source

On Markov Chains for Independent Sets

Journal of Algorithms, 2000
Given 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, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sara Miner More, Pavel Naumov
openaire   +3 more sources

Accelerating Local Search for the Maximum Independent Set Problem

The Sea, 2016
Computing high-quality independent sets quickly is an important problem in combinatorial optimization. Several recent algorithms have shown that kernelization techniques can be used to find exact maximum independent sets in medium-sized sparse graphs, as
Jakob Dahlum, S. Lamm, P. Sanders, Christian Schulz, Darren Strash, Renato F. Werneck   +5 more
semanticscholar   +1 more source

Facets of the independent set polytope

Mathematical Programming, 2003
The 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

Independent Sets

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

UNIONS OF PRODUCTS OF INDEPENDENT SETS

Real Analysis Exchange, 1993
Summary: 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, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources