6740 search results - page 274 / 1348 » An s -Hamiltonian Line Graph Problem |
91
Voted
SDM
2009
SIAM
15 years 10 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...
138
click to vote
PARA
2004
Springer
15 years 6 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...
113
click to vote
GD
2009
Springer
15 years 5 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 ...
100
Voted
CORR
2010
Springer
15 years 28 days 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...
92
Voted
CORR
2007
Springer
15 years 24 days ago
2007
Springer
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely...