5473 search results - page 658 / 1095 » On the graph isomorphism problem |
164
click to vote
ICIAP
2003
ACM
16 years 1 days ago
2003
ACM
In this paper we present a new matching method called Tuple Matching (TM), which is an algorithm for matching of signatures. Since signatures can contain arbitrary features like c...
188
click to vote
ASUNAM
2009
IEEE
15 years 12 months ago
2009
IEEE
Community detection in social networks varying with time is a common yet challenging problem whereby efficient visualization of evolving relationships and implicit hierarchical s...
178
click to vote
HPDC
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we address the problem of resource discovery in a grid based multimedia environment, where the resources providers, i.e. servers, are intermittently available. Give...
156
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
189
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...