2127 search results - page 209 / 426 » Computing large matchings fast |
138
click to vote
GD
2000
Springer
15 years 8 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 ...
123
click to vote
SC
1995
ACM
15 years 8 months ago
1995
ACM
The design of a parallel implementation of multilevel recursive spectral bisection on the Cray T3D is described. The code is intended to be fast enough to enable dynamic repartiti...
272
click to vote
ICDE
2006
IEEE
16 years 6 months ago
2006
IEEE
Todays abundance of storage coupled with digital technologies in virtually any scientific or commercial application such as medical and biological imaging or music archives deal w...
129
click to vote
ACHI
2009
IEEE
15 years 11 months ago
2009
IEEE
In today’s continuously changing markets newly developed products often do not meet the demands and expectations of customers. Research on this problem identified a large gap b...
146
Voted
ASUNAM
2010
IEEE
15 years 6 months ago
2010
IEEE
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...