This paper presents a modification for robust minutiae based fingerprint verification methods that use Delaunay triangulations. The purpose of this modification is to decrease the number of comparison operations and the error rates within the matching process, by doing a full analysis of the Delaunay triangles. From this full analysis, a modified method was proposed. The identified minutiae rep...

The focus of this paper is to endow step-wise modification of nets with refinement that preserves liveness. Modification of nets uses rules that allow substituting subnets of the left hand side by subnets of the right hand side of the rule. Such rules are then restricted so that the liveness is preserved. Rule-based modification is expressed in terms of spans of morphisms and two pushout constr...

altan derivatives of polycyclic conjugated hydrocarbons were recently introduced and studied in theoretical organic chemistry. we now provide a generalization of the altan concept, applicable to any graph. several earlier noticed topological properties of altan derivatives of polycyclic conjugated hydrocarbons are shown to be the properties of all altan derivatives of all graphs. among these ar...

let g be a (p,q) graph. an injective map f : e(g) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: v (g) → z - {0} defined by f*(v) = σp∈ev f (e) is one-one where ev denotes the set of edges in g that are incident with a vertex v and f*(v (g)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} u {±k(p+1)/2} according a...

In this paper, a novel component-based scene graph is proposed, in which all objects in the scene are classified to different entities, and a scene can be represented as a hierarchical graph composed of the instances of entities. Each entity contains basic data and its operations which are encapsulated into the entity component. The entity possesses certain behaviours which are responses to rul...

Social networking is gaining enormous popularity in the past few years. However, the popularity may also bring unexpected consequences for users regarding safety and privacy concerns. To prevent privacy being breached and modeling a social network as a weighted graph, many effective anonymization techniques have been proposed. In this work, we consider the edge weight anonymity problem. In part...

In this study, we address the independent set enumeration problem. Although several efficient algorithms and careful analyses have been proposed for maximal sets, no fine-grained analysis has given non-maximal variant. As main result, propose an algorithm variant that runs in O(q) amortized time linear space, where q is clique number, i.e., maximum size of a input graph. Note works correctly ev...

a emph{signed graph} (or, in short, emph{sigraph}) $s=(s^u,sigma)$ consists of an underlying graph $s^u :=g=(v,e)$ and a function $sigma:e(s^u)longrightarrow {+,-}$, called the signature of $s$. a emph{marking} of $s$ is a function $mu:v(s)longrightarrow {+,-}$. the emph{canonical marking} of a signed graph $s$, denoted $mu_sigma$, is given as $$mu_sigma(v) := prod_{vwin e(s)}sigma(vw).$$the li...

In the family of clustering problems we are given a set of objects (vertices of the graph), together with some observed pairwise similarities (edges). The goal is to identify clusters of similar objects by slightly modifying the graph to obtain a cluster graph (disjoint union of cliques). Hüffner et al. [LATIN 2008, Theory Comput. Syst. 2010] initiated the parameterized study of Cluster Vertex ...

This paper discusses a new approach to QoS routing, introducing the notion of algorithm resilience (i.e., its capability to adapt to network and load modifications) as performance index of the algorithm itself, for a given network topology, load and traffic pattern. The new approach can be summarized as Network Graph Reduction, i.e., a modification of the graph describing the network before the...