2503 search results - page 215 / 501 » A study of 3-arc graphs |
161
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...
179
click to vote
DM
2007
15 years 6 months ago
2007
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...
202
click to vote
SIAMJO
2008
15 years 6 months ago
2008
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....
156
click to vote
AI
2002
Springer
15 years 6 months ago
2002
Springer
The emergence of social conventions in multi-agent systems has been analyzed mainly in settings where every agent may interact either with every other agent or with nearest neighb...
170
click to vote
SRDS
1998
IEEE
15 years 11 months ago
1998
IEEE
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...