9842 search results - page 279 / 1969 » The Complexity of the Matching-Cut Problem |
86
Voted
HICSS
2003
IEEE
15 years 6 months ago
2003
IEEE
This paper1 provides a view of modeling the information dominance problem of military systems as representative of modeling other complex systems. The ideas are an extension of ea...
119
Voted
ISMVL
2000
IEEE
15 years 5 months ago
2000
IEEE
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
120
click to vote
FOCS
1999
IEEE
15 years 5 months ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
72
Voted
ICTAC
2005
Springer
15 years 6 months ago
2005
Springer
We present a new derivation of eļ¬cient algorithms for a class of optimization problems called maximum marking problems. We extend the class of weight functions used in the speciļ...
90
Voted
ISAAC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We consider the problems of hypergraph and minor crossing minimization, and point out a relation between these two problems which has not been exploited before. We presen...