3958 search results - page 304 / 792 » Dynamic Graph Algorithms with Applications |
185
click to vote
INFORMS
2010
15 years 4 months ago
2010
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
170
click to vote
JMLR
2010
15 years 1 months ago
2010
The topic of the paper is computer testing of (probabilistic) conditional independence (CI) implications by an algebraic method of structural imsets. The basic idea is to transfor...
207
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
206
click to vote
CODES
2007
IEEE
15 years 8 months ago
2007
IEEE
In this paper, we propose an efficient technique for run-time application mapping onto Network-on-Chip (NoC) platforms with multiple voltage levels. Our technique consists of a re...
140
click to vote
GD
2005
Springer
16 years 6 days ago
2005
Springer
Force-directed placement is a widely used approach to automatically arranging the nodes and edges of a relational diagram or graph in an aesthetically pleasing manner. The adoption...