505 search results - page 3 / 101 » On A Graph Formalism for Ordered Edges |
MSR
2005
ACM
13 years 11 months ago
2005
ACM
Source Control Repositories are used in most software projects to store revisions to source code files. These repositories operate at the file level and support multiple users. ...
SDM
2010
SIAM
13 years 7 months ago
2010
SIAM
We study the application of spectral clustering, prediction and visualization methods to graphs with negatively weighted edges. We show that several characteristic matrices of gra...
SIAMDM
2010
13 years 4 months ago
2010
For a graph G = (V, E) we consider vertex-k-labellings f : V → {1, 2, . . . , k} for which the induced edge weighting w : E → {2, 3, . . . , 2k} with w(uv) = f(u) + f(v) is inj...
DSD
2003
IEEE
13 years 11 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...
WG
1999
Springer
13 years 10 months ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...