4074 search results - page 187 / 815 » Abstract Graph Transformation |
122
Voted
GD
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. This paper describes a system for Graph dRawing with Intelligent Placement, GRIP. The GRIP system is designed for drawing large graphs and uses a novel multi-dimensional ...
117
Voted
DAM
2006
15 years 2 months ago
2006
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
136
click to vote
TPDS
2010
15 years 26 days ago
2010
Abstract—We propose an algorithm that provides for deadlockfree and livelock-free routing, in particular in wormhole routed networks. The proposed algorithm requires nearly minim...
174
Voted
CPM
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We consider the problem of highly space-efficient representation of separable graphs while supporting queries in constant time in the RAM with logarithmic word size. In p...
122
click to vote
WAW
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...