Modern search engines answer keyword-based queries extremely efficiently. The
impressive speed is due to clever inverted index structures, caching, a domain-independent …

This article reviews the available methods for automated identification of objects in digital
images. The techniques are classified into groups according to the nature of the …

We present a line matching algorithm which utilizes both the local appearance of lines and
their geometric attributes. To overcome the problem of segment fragmentation and …

'Network'is a heavily overloaded term, so that 'network analysis' means different things to
different people. Specific forms of network analysis are used in the study of diverse …

The maximum clique problem is a classical problem in combinatorial optimization which
finds important applications in different domains. In this paper we try to give a survey of …

Error-tolerant graph matching is a powerful concept that has various applications in pattern
recognition and machine vision. In the present paper, a new distance measure on graphs is …

This paper proposes a robust approach to image matching by exploiting the only available
geometric constraint, namely, the epipolar constraint. The images are uncalibrated, namely …

We modify an algorithm of Bron and Kerbosch [1973] for maximal clique enumeration to
choose more carefully the order in which the vertices are processed, giving us a fixed …

In approximate, or error-correcting, graph matching one considers a set of graph edit
operations, and defines the edit distance of two graphs g1 and g2 as the shortest (or least …

The degeneracy of an n-vertex graph G is the smallest number d such that every subgraph
of G contains a vertex of degree at most d. We show that there exists a nearly-optimal fixed …