937 search results - page 12 / 188 » On the Complexity of Partial Order Properties |
WADS
2007
Springer
15 years 4 months ago
2007
Springer
Connectivity augmentation problems ask for adding a set of at most k edges whose insertion makes a given graph satisfy a specified connectivity property, such as bridge-connectivi...
ANOR
2008
14 years 10 months ago
2008
Abstract Given a collection of individual preferences defined on a same finite set of candidates, we consider the problem of aggregating them into a collective preference minimizin...
108
click to vote
ISAAC
1993
Springer
15 years 2 months ago
1993
Springer
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
MKWI
2008
14 years 11 months ago
2008
: Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing o...
VVS
1998
IEEE
15 years 2 months ago
1998
IEEE
A visibility ordering of a set of objects, from a given viewpoint, is a total order on the objects such that if object a obstructs object b, then b precedes a in the ordering. Suc...