1162 search results - page 81 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
PARELEC
2002
IEEE
14 years 1 months ago
2002
IEEE
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...
COMPGEOM
2006
ACM
14 years 20 hour ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
SDM
2009
SIAM
14 years 5 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...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
DATE
2005
IEEE
14 years 1 months ago
2005
IEEE
As compared to a large spectrum of performance optimizations, relatively little effort has been dedicated to optimize other aspects of embedded applications such as memory space r...