40 search results - page 3 / 8 » Faster subtree isomorphism |
SIGCOMM
2009
ACM
14 years 2 months ago
2009
ACM
Assigning the resources of a virtual network to the components of a physical network, called Virtual Network Mapping, plays a central role in network virtualization. Existing appr...
ICNP
2005
IEEE
14 years 1 months ago
2005
IEEE
Some of the fastest practical algorithms for IP route lookup are based on space-efficient encodings of multi-bit tries [1, 2]. Unfortunately, the time required by these algorithm...
ECCV
1998
Springer
14 years 9 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
ALENEX
2007
13 years 9 months ago
2007
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...