882 search results - page 114 / 177 » On the Hardness of Graph Isomorphism |
151
click to vote
JSSPP
2009
Springer
16 years 14 days ago
2009
Springer
The number of applications with many parallel cooperating processes is steadily increasing, and developing efficient runtimes for their execution is an important task. Several fram...
143
click to vote
ICPP
2007
IEEE
16 years 6 days ago
2007
IEEE
Program parallelization requires mapping computation and data to processing elements. Navigational Programming (NavP), based on the principle of migrating computations, offers a d...
162
click to vote
FOCS
2006
IEEE
15 years 12 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
133
click to vote
STACS
2004
Springer
15 years 11 months ago
2004
Springer
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
160
click to vote
ESOP
2009
Springer
15 years 9 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...