1002 search results - page 41 / 201 » Towards Graph Programs for Graph Algorithms |
144
click to vote
WEA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
171
click to vote
IOR
2011
14 years 10 months ago
2011
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
145
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
138
click to vote
PLDI
2003
ACM
15 years 9 months ago
2003
ACM
As more complex DSP algorithms are realized in practice, an increasing need for high-level stream abstractions that can be compiled without sacrificing efficiency. Toward this en...
165
Voted
ASP
2005
Springer
15 years 9 months ago
2005
Springer
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...