225 search results - page 8 / 45 » From polynomial time queries to graph structure theory |
CP
2008
Springer
14 years 11 months ago
2008
Springer
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
JCB
2007
14 years 9 months ago
2007
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
TAMC
2010
Springer
14 years 8 months ago
2010
Springer
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...
119
click to vote
ESA
2007
Springer
15 years 3 months ago
2007
Springer
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...