2314 search results - page 164 / 463 » Minimal Partitions of a Graph |
155
click to vote
DSD
2003
IEEE
15 years 9 months ago
2003
IEEE
Heuristic algorithms for coloring the edges of large undirected single-edge graphs with (or very close to) the minimal number of colors are presented. Compared to simulated anneal...
119
click to vote
EJC
2010
15 years 4 months ago
2010
In our previous paper, we presented the combinatorial theory for minimal isostatic pinned frameworks - Assur graphs - which arise in the analysis of mechanical linkages. In this p...
144
click to vote
ICDE
2009
IEEE
15 years 10 months ago
2009
IEEE
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
127
click to vote
GD
2004
Springer
15 years 9 months ago
2004
Springer
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
144
click to vote
GD
1998
Springer
15 years 8 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...