116
click to vote
COCOON
15 years 6 months ago
2003 Springer 
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...
123
click to vote
COCOON
15 years 6 months ago
2003 Springer
Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by...
117
click to vote
COCOON
15 years 6 months ago
2003 Springer
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...
104
click to vote
COCOON
15 years 6 months ago
2003 Springer
Abstract. While the original stable marriage problem requires all participants to rank all members of the opposite sex in a strict order, two natural variations are to allow for in...
COCOON
15 years 6 months ago
2003 Springer 
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
|
Combinatorics