E-resources
-
Gurvich, Vladimir
Discrete Applied Mathematics, 03/2011, Volume: 159, Issue: 5Journal Article
Let us consider two binary systems of inequalities (i) C x ≥ e and (ii) C x ≤ e , where C ∈ { 0 , 1 } m × n is an m × n ( 0 , 1 ) -matrix, x ∈ { 0 , 1 } n , and e is the vector of m ones. The set of all support-minimal (respectively, support-maximal) solutions x to (i) (respectively, to (ii)) is called the blocker (respectively, anti-blocker). A blocker B (respectively, anti-blocker A ) is called exact if C x = e for every x ∈ B (respectively, x ∈ A ). Exact blockers can be completely characterized. There is a one-to-one correspondence between them and P 4 -free graphs (along with a well-known one-to-one correspondence between the latter and the so-called read-once Boolean functions). However, the class of exact anti-blockers is wider and more sophisticated. We demonstrate that it is closely related to the so-called CIS graphs, more general ℓ -CIS d -graphs, and Δ -conjecture.
Author
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Shelf entry
Permalink
- URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year | Impact factor | Edition | Category | Classification | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Select the library membership card:
If the library membership card is not in the list,
add a new one.
DRS, in which the journal is indexed
Database name | Field | Year |
---|
Links to authors' personal bibliographies | Links to information on researchers in the SICRIS system |
---|
Source: Personal bibliographies
and: SICRIS
The material is available in full text. If you wish to order the material anyway, click the Continue button.