1998 search results - page 115 / 400 » Complexity of the Cover Polynomial |
164
click to vote
JCP
2006
15 years 5 months ago
2006
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
137
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We study the set of all pseudoline arrangements with contact points which cover a given support. We define a notion of flip which transforms a pseudoline arrangement with contact...
139
click to vote
STOC
1993
ACM
15 years 9 months ago
1993
ACM
We study the Maximum Flow Network Interdiction Problem (MFNIP). We present two classes of polynomially separable valid inequalities for Cardinality MFNIP. We also prove the integr...
107
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract: This document contains the Intellectual Property Statement and the technical description of the MQQ-SIG - a new public key digital signature scheme. The complete scientif...
160
click to vote
ESA
2009
Springer
16 years 2 days ago
2009
Springer
In this paper, we give evidence for the problems Disjoint Cycles and Disjoint Paths that they cannot be preprocessed in polynomial time such that resulting instances always have a ...