402 search results - page 68 / 81 » On Finding the Number of Graph Automorphisms |
COMGEO
2008
ACM
13 years 7 months ago
2008
ACM
A wireless ad-hoc network can be represented as a graph in which the nodes represent wireless devices, and the links represent pairs of nodes that communicate directly by means of...
JPDC
2008
13 years 7 months ago
2008
In this paper, we present parallel multilevel algorithms for the hypergraph partitioning problem. In particular, we describe schemes for parallel coarsening, parallel greedy k-way...
TKDE
2008
13 years 7 months ago
2008
Given a transportation network having source nodes with evacuees and destination nodes, we want to find a contraflow network configuration (that is, ideal direction for each edge) ...
COMBINATORICS
2002
13 years 7 months ago
2002
We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns. If such a matrix is ...
IEEESCC
2009
IEEE
13 years 5 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...