96 search results - page 8 / 20 » New Plain-Exponential Time Classes for Graph Homomorphism |
SIAMCOMP
2010
13 years 3 months ago
2010
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
SIMUTOOLS
2008
13 years 10 months ago
2008
We sketch the fundamental properties and features of Snoopy, a tool to model and execute (animate, simulate) hierarchical graph-based system descriptions. The tool comes along wit...
GD
2005
Springer
14 years 2 months ago
2005
Springer
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
WG
1998
Springer
14 years 23 days ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
ADBIS
2010
Springer
13 years 10 months ago
2010
Springer
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...