Sciweavers

2125 search results - page 122 / 425
» On Graph Complexity
Sort
View
EDBT
2006
ACM
174views Database» more  EDBT 2006»
15 years 10 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
FOCS
2007
IEEE
15 years 4 months ago
Can you beat treewidth?
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
Dániel Marx
TALG
2008
97views more  TALG 2008»
14 years 10 months ago
On an infinite family of solvable Hanoi graphs
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
Dany Azriel, Noam Solomon, Shay Solomon
ICCS
2009
Springer
15 years 4 months ago
Conceptual Graph Rules and Equivalent Rules: A Synthesis
This paper is an extended abstract of the talk given at ICCS’09. Rules have long been considered as an essential component of knowledge-based systems. We focus here on conceptual...
Marie-Laure Mugnier
ADBIS
2010
Springer
237views Database» more  ADBIS 2010»
14 years 11 months ago
Graph Object Oriented Database for Semantic Image Retrieval
This paper presents a new method for image retrieval using a graph object oriented database for processing the information extracted from the image through the segmentation process...
Eugen Ganea, Marius Brezovan