Pages that link to "Item:Q801133"

The following pages link to A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I (Q801133):

Displaying 8 items.

• A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I (Q801133) (← links)
• A graph theoretic upper bound on the permanent of a nonnegative integer matrix. II. The extremal case (Q801134) (← links)
• Handle bases and bounds on the number of subgraphs (Q1087883) (← links)
• Exploration of NP-hard enumeration problems by simulated annealing -- the spectrum values of permanents (Q1285571) (← links)
• Comparison of permanental bounds of \((0,1)\)-matrices (Q1392571) (← links)
• An upper bound for the permanent of a nonnegative matrix (Q1808957) (← links)
• An interpretation of the Dittert conjecture in terms of semi-matchings (Q2455576) (← links)
• Some upper bounds for permanents of (0, 1)-matrices (Q3511473) (← links)