882 search results - page 166 / 177 » On the Hardness of Graph Isomorphism |
139
click to vote
VISUALIZATION
2005
IEEE
15 years 11 months ago
2005
IEEE
Topological concepts and techniques have been broadly applied in computer graphics and geometric modeling. However, the homotopy type of a mapping between two surfaces has not bee...
147
click to vote
PODC
2005
ACM
15 years 11 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
141
click to vote
PODC
2005
ACM
15 years 11 months ago
2005
ACM
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...
149
click to vote
PPOPP
2005
ACM
15 years 11 months ago
2005
ACM
In this paper, we develop a new language construct to address one of the pitfalls of parallel programming: precise handling of events across parallel components. The construct, te...
161
Voted
SIGECOM
2005
ACM
15 years 11 months ago
2005
ACM
We study first-price auction mechanisms for auctioning flow between given nodes in a graph. A first-price auction is any auction in which links on winning paths are paid their ...