44 search results - page 1 / 9 » Holant Problems for Regular Graphs with Complex Edge Functio... |
STACS
2010
Springer
13 years 12 months ago
2010
Springer
ICDM
2010
IEEE
13 years 2 months ago
2010
IEEE
The growth of the web has directly influenced the increase in the availability of relational data. One of the key problems in mining such data is computing the similarity between o...
ICDE
2011
IEEE
12 years 8 months ago
2011
IEEE
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
Features in many real world applications such as Cheminformatics, Bioinformatics and Information Retrieval have complex internal structure. For example, frequent patterns mined fr...
JACM
2000
13 years 4 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...