2398 search results - page 85 / 480 » Constraint Programming and Graph Algorithms |
192
click to vote
ICTAI
2008
IEEE
15 years 11 months ago
2008
IEEE
Frequent patterns in program executions represent recurring sequences of events. These patterns can be used to reveal the hidden structures of a program, and ease the comprehensio...
141
click to vote
TMC
2008
15 years 4 months ago
2008
In this paper, we consider multihop wireless mesh networks, where each router node is equipped with multiple radio interfaces, and multiple channels are available for communication...
117
click to vote
ICALP
1997
Springer
15 years 9 months ago
1997
Springer
We prove that, for any fixed k, one can construct a linear time algorithm that checks if a graph has branchwidth≤ k and, if so, outputs a branch decomposition of minimum width....
130
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
156
click to vote
CONSTRAINTS
2010
15 years 4 months ago
2010
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-fi...