Sciweavers

1154 search results - page 83 / 231
» On the editing distance of graphs
Sort
View
IV
2003
IEEE
183views Visualization» more  IV 2003»
14 years 3 months ago
Visualisation of RDF(S)-based Information
As Resource Description Framework (RDF) reaches maturity, there is an increasing need for tools that support it. A common and natural representation for RDF data is a directed lab...
Alexandru Telea, Flavius Frasincar, Geert-Jan Houb...
JDA
2007
97views more  JDA 2007»
13 years 10 months ago
Local solutions for global problems in wireless networks
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
Jorge Urrutia
BMCBI
2007
137views more  BMCBI 2007»
13 years 10 months ago
Bayesian refinement of protein functional site matching
Background: Matching functional sites is a key problem for the understanding of protein function and evolution. The commonly used graph theoretic approach, and other related appro...
Kanti V. Mardia, Vysaul B. Nyirongo, Peter J. Gree...
ECEASST
2008
91views more  ECEASST 2008»
13 years 10 months ago
Graph Transformation Model of a Triangulated Network of Mobile Units
Abstract: A triangulated network of mobile units is modelled by means of a graph transformation system in which graph nodes are labelled with geometric coordinates and edges are la...
Stefan Gruner
COMBINATORICS
2002
83views more  COMBINATORICS 2002»
13 years 9 months ago
Identifying Codes with Small Radius in Some Infinite Regular Graphs
Let G = (V, E) be a connected undirected graph and S a subset of vertices. If for all vertices v V , the sets Br(v) S are all nonempty and different, where Br(v) denotes the set...
Irène Charon, Olivier Hudry, Antoine Lobste...