Sciweavers

882 search results - page 16 / 177
» On the Hardness of Graph Isomorphism
Sort
View
SIGMOD
2007
ACM
186views Database» more  SIGMOD 2007»
14 years 8 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
ISAAC
2004
Springer
153views Algorithms» more  ISAAC 2004»
14 years 2 months ago
Canonical Data Structure for Interval Probe Graphs
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
Ryuhei Uehara
SIGCOMM
2009
ACM
14 years 3 months ago
A virtual network mapping algorithm based on subgraph isomorphism detection
Assigning the resources of a virtual network to the components of a physical network, called Virtual Network Mapping, plays a central role in network virtualization. Existing appr...
Jens Lischka, Holger Karl
GD
1994
Springer
14 years 21 days ago
Visibility Graphs and Oriented Matroids
We describe a set of necessary conditions for a given graph to be the visibility graph of a simple polygon. For every graph satisfying these conditions we show that a uniform rank ...
James Abello, Krishna Kumar
EDBT
2008
ACM
166views Database» more  EDBT 2008»
14 years 8 months ago
A novel spectral coding in a large graph database
Retrieving related graphs containing a query graph from a large graph database is a key issue in many graph-based applications, such as drug discovery and structural pattern recog...
Lei Zou, Lei Chen 0002, Jeffrey Xu Yu, Yansheng Lu