Sciweavers

248 search results - page 26 / 50
» On the Cayley isomorphism problem
Sort
View
ARSCOM
2008
117views more  ARSCOM 2008»
13 years 11 months ago
Subset Counting in Trees
Various enumeration problems for classes of simply generated families of trees have been the object of investigation in the past. We mention the enumeration of independent subsets,...
Stephan G. Wagner
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
14 years 4 months ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm
DM
2006
128views more  DM 2006»
13 years 10 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
ICDE
2007
IEEE
167views Database» more  ICDE 2007»
15 years 3 days ago
GString: A Novel Approach for Efficient Search in Graph Databases
Graphs are widely used for modeling complicated data, including chemical compounds, protein interactions, XML documents, and multimedia. Information retrieval against such data ca...
Haoliang Jiang, Haixun Wang, Philip S. Yu, Shuigen...
PVLDB
2010
110views more  PVLDB 2010»
13 years 9 months ago
Graph Homomorphism Revisited for Graph Matching
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Hongzhi Wang, ...