Searching for authors named "Endre Boros" – sorted by Relevance.
60 documents found, showing 1 through 10.
Next 10 →
-
Sequential Diagnosis of Double Regular Systems
- …We consider the problem of testing sequentially the components of a double regular system, when the testing of each component is costly. Generalizing earlier results about k-out-of-n systems, we provide a polynomial time algorithm for the most cost-efficient sequential testing of double regular syst…
- Add To MetaCart
-
On Perfect 0,±1 Matrices
- …Perfect 0, 1 matrices were introduced recently in [5] as a generalization of the well-studied class of perfect 0, 1 matrices. In this paper we provide a characterization of perfect 0, 1 matrices in terms of an associated perfect graph which one can build in O(n 2 m) time, where m n is the s…
- Add To MetaCart
-
On the Number of Flats Spanned by a Set of Points in ...
- …It is shown that for fixed 1 # r # s < d and # > 0, if X # PG(d, q) contains (1+#)q s points, then the number of r-flats spanned by X is at least c(#)q (r+1)(s+1-r) , i.e. a positive fraction of the number of r-flats in PG(s + 1, q). 1 Introduction Let PG(d, q) denote the d-dimensional fin…
- Add To MetaCart
-
Perfect Graphs are Kernel Solvable
- …In this paper we prove that perfect graphs are kernel solvable, as it was conjectured by Berge and Duchet (1983). The converse statement, i.e. that kernel solvable graphs are perfect, was also conjectured in the same paper, and is still open. In this direction we prove that it is always possible to …
- Cited by 1 (1 self) – Add To MetaCart
-
Stable Effectivity Functions and Perfect Graphs
- …We consider the problem of characterizing the stability of e#ectivity functions (EFF), via a correspondence between game theoretic and well-known combinatorial concepts. To every EFF we assign a pair of hypergraphs, representing clique covers of two associated graphs, and obtain some necessary and s…
- Cited by 1 (1 self) – Add To MetaCart
-
Sequential Testing of Series-Parallel Systems of Small Depth
- …We consider the problem of testing sequentially the components of a multi component system, when the testing of each component is costly. We consider a polynomial time testing policy for series-parallel systems, proposed in the literature. Generalizing published results, we prove that the considered…
- Cited by 1 (1 self) – Add To MetaCart
-
On the Complexity of Horn Minimization
- …Boolean functions given in disjunctive normal form representation are considered in this paper. For a given function such a representation is typically not unique and different representations may consist of different number of terms. The problem of minimizing a Boolean formula ammounts to finding i…
- Cited by 3 (1 self) – Add To MetaCart
-
Diagnosing Double Regular Systems
- ….We consider the problem of testing sequentially the components of a double regular system, when the testing of each component is costly. Generalizing earlier results about k-out-of-n systems, we provide a polynomial time algorithm for the most cost-effficient sequential testing of double regular…
- Cited by 1 (0 self) – Add To MetaCart
-
On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles
- …Let g be a positional game with perfect information modelled by a directed graph G = (V, E) which is finite but may have directed cycles. A local cost function f(i, e) is given for every player i 2 I and for every move e 2 E. The players are allowed only pure stationary strategies, that is the move …
- Add To MetaCart
-
Transversal Hypergraphs to Perfect Matchings in Bipartite Graphs: Characterization and Generation Algorithms *
- …Abstract A minimal blocker in a bipartite graph G is a minimal set of edges the removal of which leaves no perfect matching in G. We give an explicit characterization of the minimal blockers of a bipartite graph G. This result allows us to obtain a polynomial delay algorithm for finding all minimal …
- Add To MetaCart
Showing 1 through 10.
Next 10 →
