1002 search results - page 35 / 201 » Towards Graph Programs for Graph Algorithms |
124
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
124
click to vote
LICS
2009
IEEE
15 years 8 months ago
2009
IEEE
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
129
click to vote
VLC
2002
15 years 1 months ago
2002
Graph layout algorithms typically conform to one or more aesthetic criteria (e.g. minimising the number of bends, maximising orthogonality). Determining the extent to which a grap...
127
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
147
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...