5473 search results - page 241 / 1095 » On the graph isomorphism problem |
236
click to vote
MOBICOM
2012
ACM
13 years 9 months ago
2012
ACM
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
190
click to vote
COCOON
1999
Springer
15 years 11 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
202
click to vote
AI
2010
Springer
15 years 7 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
211
click to vote
CADE
2004
Springer
16 years 7 months ago
2004
Springer
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...
153
click to vote
ARITH
2003
IEEE
16 years 17 days ago
2003
IEEE
SRT division, as it was discovered in the late 1950s represented an important improvement in the speed of division algorithms for computers at the time. A variant of SRT division ...