88 search results - page 13 / 18 » On the Complexity of Matroid Isomorphism Problem |
87
Voted
PVLDB
2010
14 years 10 months ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
103
click to vote
AAAI
1994
15 years 29 days ago
1994
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...
STACS
2005
Springer
15 years 5 months ago
2005
Springer
ded abstract of this article is published in the proceedings of STACS’05, LNCS 3404, Springer Verlag. A relational structure is a core, if all its endomorphisms are embeddings. T...
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
118
click to vote
IWCIA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...