1002 search results - page 19 / 201 » Towards Graph Programs for Graph Algorithms |
MFCS
2009
Springer
15 years 6 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
101
click to vote
LION
2009
Springer
15 years 6 months ago
2009
Springer
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...
172
click to vote
SIGMOD
2008
ACM
15 years 12 months ago
2008
ACM
The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities ...
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
ICALP
1994
Springer
15 years 3 months ago
1994
Springer
We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every k 2, there is an O(V 2) time algorithm that decide...