Sciweavers

1002 search results - page 21 / 201
» Towards Graph Programs for Graph Algorithms
Sort
View
APLAS
2005
ACM
15 years 5 months ago
Register Allocation Via Coloring of Chordal Graphs
We present a simple algorithm for register allocation which is competitive with the iterated register coalescing algorithm of George and Appel. We base our algorithm on the observa...
Fernando Magno Quintão Pereira, Jens Palsbe...
JDA
2010
122views more  JDA 2010»
14 years 6 months ago
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
Ignasi Sau, Dimitrios M. Thilikos
PAMI
2007
176views more  PAMI 2007»
14 years 11 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
15 years 4 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
CORR
2011
Springer
192views Education» more  CORR 2011»
14 years 6 months ago
On cooperative patrolling: optimal trajectories, complexity analysis, and approximation algorithms
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...