Sciweavers

813 search results - page 22 / 163
» On the Boolean-Width of a Graph: Structure and Applications
Sort
View
DEXAW
1999
IEEE
119views Database» more  DEXAW 1999»
14 years 1 months ago
Structure-Based Similarity Search with Graph Histograms
Objects like road networks, CAD/CAM components, electrical or electronic circuits, molecules, can be represented as graphs, in many modern applications. In this paper, we propose ...
Apostolos Papadopoulos, Yannis Manolopoulos
IPPS
2007
IEEE
14 years 3 months ago
iC2mpi: A Platform for Parallel Execution of Graph-Structured Iterative Computations
Parallelization of sequential programs is often daunting because of the substantial development cost involved. Various solutions have been proposed to address this concern, includ...
Harnish Botadra, Qiong Cheng, Sushil K. Prasad, Er...
ICDE
2008
IEEE
157views Database» more  ICDE 2008»
14 years 10 months ago
TALE: A Tool for Approximate Large Graph Matching
Abstract-- Large graph datasets are common in many emerging database applications, and most notably in large-scale scientific applications. To fully exploit the wealth of informati...
Yuanyuan Tian, Jignesh M. Patel
GD
1995
Springer
14 years 17 days ago
Graph Layout Adjustment Strategies
Abstract. When adjusting a graph layout, it is often desirable to preserve various properties of the original graph in the adjusted view. Pertinent properties may include straightn...
Margaret-Anne D. Storey, Hausi A. Müller
SEMWEB
2007
Springer
14 years 3 months ago
Structure Preserving Semantic Matching
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
Fausto Giunchiglia, Mikalai Yatskevich, Fiona McNe...