823 search results - page 73 / 165 » Brick partitions of graphs |
213
click to vote
WAW
2010
Springer
15 years 4 months ago
2010
Springer
We give algorithms for finding graph clusters and drawing graphs, highlighting local community structure within the context of a larger network. For a given graph G, we use the per...
166
click to vote
GD
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. Problems in simultaneous graph drawing involve the layout of several graphs on a shared vertex set. This paper describes a Graph Simultaneous Embedding Tool, GraphSET, de...
156
click to vote
ICPP
2007
IEEE
16 years 1 months ago
2007
IEEE
Program parallelization requires mapping computation and data to processing elements. Navigational Programming (NavP), based on the principle of migrating computations, offers a d...
174
click to vote
SIAMDM
2008
15 years 6 months ago
2008
Let Kn,n denote the complete bipartite graph with n vertices in each partite set and Kn,n +I denote Kn,n with a 1-factor added. It is proved in this paper that there exists an m-c...
203
click to vote
ALMOB
2006
15 years 6 months ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...