1951 search results - page 186 / 391 » An algorithm for improving graph partitions |
184
click to vote
GD
1998
Springer
15 years 10 months ago
1998
Springer
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
193
click to vote
SIGMOD
2010
ACM
15 years 4 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
159
click to vote
JGAA
2000
15 years 5 months ago
2000
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
162
Voted
CVPR
2006
IEEE
16 years 2 days ago
2006
IEEE
This paper adds a number of novel concepts into global s/t cut methods improving their efficiency and making them relevant for a wider class of applications in vision where algor...
215
click to vote
PPOPP
2003
ACM
15 years 11 months ago
2003
ACM
Large-scale cluster-based Internet services often host partitioned datasets to provide incremental scalability. The aggregation of results produced from multiple partitions is a f...