This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators working on it. It is shown that this representation...
A loose semantics for graph transformation rules which has been developed recently is used in this paper for the compositional verification of specifications. The main conceptual t...
This position paper advocates a possible bridging of multiple heterogeneous formats and interfaces for hypermedia data and metadata. Rather than one more text, bit-stream or proced...
Abstract. The nearest neighbor and the perceptron algorithms are intuitively motivated by the aims to exploit the “cluster” and “linear separation” structure of the data to...
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...