Sciweavers

248 search results - page 17 / 50
» On the Cayley isomorphism problem
Sort
View
SIGMOD
2007
ACM
186views Database» more  SIGMOD 2007»
14 years 10 months ago
Fg-index: towards verification-free query processing on graph databases
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...
James Cheng, Yiping Ke, Wilfred Ng, An Lu
WG
1998
Springer
14 years 2 months ago
Integral Uniform Flows in Symmetric Networks
We study the integral uniform (multicommodity) flow problem in a graph G and construct a fractional solution whose properties are invariant under the action of a group of automorp...
Farhad Shahrokhi, László A. Sz&eacut...
ROBOTICA
2008
100views more  ROBOTICA 2008»
13 years 10 months ago
A symbolic approach to polyhedral scene analysis by parametric calotte propagation
Polyhedral scene analysis studies whether a 2D line drawing of a 3D polyhedron is realizable in the space, and if so, parameterizing the space of all possible realizations. For gen...
Hongbo Li, Lina Zhao, Ying Chen
ICDAR
2009
IEEE
13 years 8 months ago
Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming
In this paper, we tackle the problem of localizing graphical symbols on complex technical document images by using an original approach to solve the subgraph isomorphism problem. ...
Pierre Le Bodic, Hervé Locteau, Séba...
IPL
2008
114views more  IPL 2008»
13 years 10 months ago
Faster algorithms for guided tree edit distance
The guided tree edit distance problem is to find a minimum cost series of edit operations that transforms two input forests F and G into isomorphic forests F and G such that a thi...
Dekel Tsur