Sciweavers

1199 search results - page 18 / 240
» Graph Theory
Sort
View
ICPR
2010
IEEE
14 years 10 months ago
A Conductance Electrical Model for Representing and Matching Weighted Undirected Graphs
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...
Manuel Igelmo, Alberto Sanfeliu, Miquel Ferrer
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
15 years 1 months ago
Bipartite roots of graphs
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...
Lap Chi Lau
CCCG
2008
15 years 1 months ago
Computational Balloon Twisting: The Theory of Balloon Polyhedra
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...
Erik D. Demaine, Martin L. Demaine, Vi Hart
EJC
2010
14 years 12 months ago
Combinatorial characterization of the Assur graphs from engineering
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,...
Brigitte Servatius, Offer Shai, Walter Whiteley
CLA
2007
15 years 1 months ago
Concept Graphs as Semantic Structures for Contextual Judgment Logic
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...
Rudolf Wille