In Image Database Systems, symbolic pictures are represented by 2D strings that are converted into triples. Each triple is mapped to a unique hash address for timely retrieval of pictures, reducing the pattern-matching problem corresponding to a query to that of computation of hash function. The values associated with the picture objects are used to compute hash addresses for triples developed ...

The perfect matching complex of a graph is the simplicial on edge set with facets corresponding to matchings graph. This paper studies complexes, $\mathcal{M}_p(H_{k \times m\times n})$, honeycomb graphs. For $k = 1$, $\mathcal{M}_p(H_{1\times n})$ contractible unless $n\geq m=2$, in which case it homotopy equivalent $(n-1)$-sphere. Also, $\mathcal{M}_p(H_{2\times 2\times 2})$ wedge two 3-spher...

In a graph, perfect matching cut is an edge that matching. (pmc) the problem of deciding whether given graph has cut, and known to be NP-complete. We revisit show pmc remains NP-complete when restricted bipartite graphs maximum degree 3 arbitrarily large girth. Complementing this hardness result, we give two classes in which polynomial-time solvable. The first one includes claw-free without ind...

For two bipartite graphs G and G , a bijection ψ : E(G) → E(G) is called a (perfect) matching preserver provided that M is a perfect matching in G if and only if ψ(M) is a perfect matching in G. We characterize bipartite graphs G and G which are related by a matching preserver and the matching preservers between them.

Traffic analysis is the best known approach to uncover relationships amongst users of anonymous communication systems, such as mix networks. Surprisingly, all previously published techniques require very specific user behavior to break the anonymity provided by mixes. At the same time, it is also well known that none of the considered user models reflects realistic behavior which casts some dou...

It is a longstanding open problem whether there exists a polynomial size description of the perfect matching polytope. We give a partial answer to this question by proving the following result. The polyhedron defined by the constraints of the perfect matching polytope which are active at a given perfect matching can be obtained as the projection of a compact polyhedron. Thus there exists a comp...

In this paper, we propose an algorithm for enumerating all the perfect matchings included in a given bipartite graph G = (V,E). The algorithm is improved by the approach which we proposed at ISAAC98. Our algorithm takes O(log |V |) time per perfect matching while the current fastest algorithm takes O(|V |) time per perfect matching. Keyword: enumeration, enumerating algorithm, perfect matching.