Pulleyblank W., Personal Communication to J. Ryan. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
A Set Covering Approach To Infeasibility Analysis Of Linear.. - Parker (1995) (5 citations) (Correct)
....the transversal obtained by successively picking the node having maximum degree among the currently uncovered edges is a minimum transversal. General I IS hypergraphs do not share this property; however, they do generalize bipartite graphs according to the following: Theorem 2. 10 (Pulleyblank [30]) Let S be an infeasible linear system. Then S can be partitioned into two consistent subsystems. A hypergraph is bicolorable if there exists a partition of the nodes into two sets such that neither set contains an edge (all edges cross the partition) From the previous theorem, we have that an I ....
Pulleyblank W., Personal Communication to J. Ryan.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC