882 search results - page 153 / 177 » On the Hardness of Graph Isomorphism |
PLDI
2004
ACM
14 years 2 months ago
2004
ACM
Pointer analysis is a critical problem in optimizing compiler, parallelizing compiler, software engineering and most recently, hardware synthesis. While recent efforts have sugges...
STOC
2004
ACM
14 years 2 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
SENSYS
2003
ACM
14 years 1 months ago
2003
ACM
Simple in-network data aggregation (or fusion) techniques for sensor networks have been the focus of several recent research efforts, but they are insufficient to support advance...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
STOC
2010
ACM
14 years 1 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...