Related papers: A Set-Theoretic Framework for Parallel Graph Rewri…
Relationship between agents can be conveniently represented by graphs. When these relationships have different modalities, they are better modelled by multilayer graphs where each layer is associated with one modality. Such graphs arise…
In this paper we present a new termination proof and complexity analysis of unfolding graph rewriting which is a specific kind of infinite graph rewriting expressing the general form of safe recursion. We introduce a termination order over…
Graph matching, also known as network alignment, refers to finding a bijection between the vertex sets of two given graphs so as to maximally align their edges. This fundamental computational problem arises frequently in multiple fields…
We identify the graph data structure, frontiers, operators, an iterative loop structure, and convergence conditions as essential components of graph analytics systems based on the native-graph approach. Using these essential components, we…
For any graph $G$ on $n$ vertices and for any {\em symmetric} subgraph $J$ of $K_{n,n}$, we construct an infinite sequence of graphs based on the pair $(G,J)$. The First graph in the sequence is $G$, then at each stage replacing every…
In this paper, we introduce a graph matching method that can account for constraints of arbitrary order, with arbitrary potential functions. Unlike previous decomposition approaches that rely on the graph structures, we introduce a…
We establish a renormalization group approach which is implemented on the degrees of freedom defined by the overlap of two replicas to determine the critical fixed point and to extract four critical exponents for the phase transition of the…
Graph summarization is beneficial in a wide range of applications, such as visualization, interactive and exploratory analysis, approximate query processing, reducing the on-disk storage footprint, and graph processing in modern hardware.…
Multigraph matching is a recent variant of the graph matching problem. In this framework, the optimization procedure considers several graphs and enforces the consistency of the matches along the graphs. This constraint can be formalized as…
Graphs, and graph transformation systems, are used in many areas within Computer Science: to represent data structures and algorithms, to define computation models, as a general modelling tool to study complex systems, etc. Research in term…
Given two planar graphs that are defined on the same set of vertices, a RAC simultaneous drawing is one in which each graph is drawn planar, there are no edge overlaps and the crossings between the two graphs form right angles. The…
We formalize symmetry breaking as a set-covering problem. For the case of breaking symmetries on graphs, a permutation covers a graph if applying it to the graph yields a smaller graph in a given order. Canonical graphs are those that…
Graph transformation systems have the potential to be realistic models of chemistry, provided a comprehensive collection of reaction rules can be extracted from the body of chemical knowledge. A first key step for rule learning is the…
We show an improved parallel algorithm for decomposing an undirected unweighted graph into small diameter pieces with a small fraction of the edges in between. These decompositions form critical subroutines in a number of graph algorithms.…
Extending a classic result of Johnson and Newman, this paper provides a matrix characterization for two generalized cospectral graphs with a pair of generalized cospectral vertex-deleted subgraphs. As an application, we present a new…
Extremal graph theory studies the maximum or minimum number of subgraphs isomorphic to a prescribed graph under given constraints. \textit{Localization} has recently emerged as a framework that refines such problems by assigning extremal…
We present the theory of multifunctions applied to graphs. Its interesting feature is that walks are recognized as iterations. We consider the graphs with arbitrary number of vertices which are determined by multifunctions. The mutually…
We present a new, high-level approach for the specification of model-to-model transformations based on declarative patterns. These are (atomic or composite) constraints on triple graphs declaring the allowed or forbidden relationships…
Hierarchical structure and repetition are prevalent in graphs originating from nature or engineering. These patterns can be represented by a class of parametric-structure graphs, which are defined by templates that generate structure by way…
Let $G$ be a connected graph and $\mathcal{P}(G)$ a graph parameter. We say that $\mathcal{P}(G)$ is feasible if $\mathcal{P}(G)$ satisfies the following properties: (I) $\mathcal{P}(G)\leq \mathcal{P}(G_{uv})$, if $G_{uv}=G[u\to v]$ for…