In this paper we propose a conductance electrical model to represent weighted undirected graphs that allows us to efficiently compute approximate graph isomorphism in large graph...
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
This paper builds a general mathematical and algorithmic theory for balloon-twisting structures, from balloon animals to balloon polyhedra, by modeling their underlying graphs (ed...
We introduce the idea of Assur graphs, a concept originally developed and exclusively employed in the literature of the kinematics community. The paper translates the terminology,...
Abstract. This paper presents a mathematization of the philosophical doctrine of judgments as an extension of the mathematization of the philosophical doctrine of concepts develope...