5473 search results - page 700 / 1095 » On the graph isomorphism problem |
204
click to vote
SDM
2012
SIAM
13 years 9 months ago
2012
SIAM
With the growth of the Internet and E-commerce, bipartite rating networks are ubiquitous. In such bipartite rating networks, there exist two types of entities: the users and the o...
188
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scala...
232
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
163
click to vote
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
192
click to vote
SODA
1998
ACM
15 years 8 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...