1545 search results - page 109 / 309 » On tree congestion of graphs |
ICALP
1995
Springer
15 years 1 months ago
1995
Springer
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
100
click to vote
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
DAM
2010
14 years 10 months ago
2010
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...
CASES
2010
ACM
14 years 8 months ago
2010
ACM
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
EUROGRAPHICS
2010
Eurographics
15 years 7 months ago
2010
Eurographics
Continuous constrained optimization is a powerful tool for synthesizing novel human motion segments that are short. Graph-based motion synthesis methods such as motion graphs and ...