288 search results - page 14 / 58 » Linearly bounded infinite graphs |
150
click to vote
PAMI
2007
15 years 3 months ago
2007
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 ...
131
click to vote
ESA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
173
click to vote
CORR
2012
Springer
14 years 2 days ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
150
click to vote
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
153
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...