5889 search results - page 228 / 1178 » Graph Layout Problems |
167
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
In this paper, we study the problem of how to generate synthetic graphs matching various properties of a real social network with two applications, privacy preserving social netwo...
205
click to vote
PARA
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
183
click to vote
GD
2009
Springer
15 years 11 months ago
2009
Springer
Traditional network visualization tools inherently suffer from scalability problems, particularly when such tools are interactive and web-based. In this paper we introduce WiGis ...
182
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. In this paper, we consider the problem of representing graphs by triangles whose sides touch. We present linear time algorithms for creating touching triangles representa...
183
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...