151 search results - page 11 / 31 » Derandomized Squaring of Graphs |
STACS
2001
Springer
13 years 11 months ago
2001
Springer
Langton’s ant is a simple discrete dynamical system, with a surprisingly complex behavior. We study its extension to general planar graphs. First we give some relations between c...
ALGORITHMICA
2010
13 years 6 months ago
2010
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
NETWORKS
2006
13 years 6 months ago
2006
In a bidirected graph, each end of each edge is independently oriented. We show how to express any column of the incidence matrix as a half-integral linear combination of any colum...
HPCC
2005
Springer
14 years 8 days ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
NIPS
2008
13 years 8 months ago
2008
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...