Sciweavers

3204 search results - page 45 / 641
» The Alcuin Number of a Graph
Sort
View
ARSCOM
2008
110views more  ARSCOM 2008»
13 years 6 months ago
Total Perfect Codes in Tensor Products of Graphs
A total perfect code in a graph is a subset of the graph's vertices with the property that each vertex in the graph is adjacent to exactly one vertex in the subset. We prove t...
Ghidewon Abay-Asmerom, Richard Hammack, Dewey T. T...
SIGMOD
2005
ACM
136views Database» more  SIGMOD 2005»
14 years 1 months ago
Optimizing recursive queries in SQL
Recursion represents an important addition to the SQL language. This work focuses on the optimization of linear requeries in SQL. To provide an abstract framework for discussion, ...
Carlos Ordonez
DAM
2011
13 years 2 months ago
A study of 3-arc graphs
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a graph ...
Martin Knor, Guangjun Xu, Sanming Zhou
ICPR
2002
IEEE
14 years 9 months ago
A New Algorithm for Inexact Graph Matching
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
Adel Hlaoui, Shengrui Wang
CAIP
2009
Springer
117views Image Analysis» more  CAIP 2009»
14 years 2 months ago
A Hypergraph-Based Model for Graph Clustering: Application to Image Indexing
Abstract. In this paper, we introduce a prototype-based clustering algorithm dealing with graphs. We propose a hypergraph-based model for graph data sets by allowing clusters overl...
Salim Jouili, Salvatore Tabbone