160 search results - page 30 / 32 » Approximating Maximum Edge 2-Coloring in Simple Graphs |
COCOON
2001
Springer
14 years 2 days ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
ALT
2010
Springer
13 years 9 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
ECCC
2006
13 years 7 months ago
2006
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
SIGGRAPH
1998
ACM
13 years 11 months ago
1998
ACM
In this paper we introduce the Progressive Forest Split (PFS) representation, a new adaptive refinement scheme for storing and transmitting manifold triangular meshes in progress...