1736 search results - page 32 / 348 » The rank-width of Directed Graphs |
109
Voted
IV
2005
IEEE
15 years 9 months ago
2005
IEEE
The conventional force-directed methods for drawing undirected graphs are based on either vertex-vertex repulsion or vertex-edge repulsion. In this paper, we propose a new force-d...
133
Voted
STOC
2007
ACM
16 years 4 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
141
click to vote
WADS
2009
Springer
15 years 10 months ago
2009
Springer
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
106
Voted
DAC
2003
ACM
16 years 4 months ago
2003
ACM
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...