5473 search results - page 203 / 1095 » On the graph isomorphism problem |
186
click to vote
WG
2009
Springer
16 years 1 months ago
2009
Springer
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...
194
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
191
click to vote
SDM
2009
SIAM
16 years 4 months ago
2009
SIAM
In this paper, we study the problem of how to generate synthetic graphs matching various properties of a real social network with two applications, privacy preserving social netwo...
233
click to vote
PARA
2004
Springer
16 years 16 days ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
199
click to vote
GD
2009
Springer
15 years 11 months ago
2009
Springer
Traditional network visualization tools inherently suffer from scalability problems, particularly when such tools are interactive and web-based. In this paper we introduce WiGis ...