1591 search results - page 10 / 319 » Random lifts of graphs |
94
Voted
CPC
2007
15 years 15 days ago
2007
We show that a random graph studied by Ioffe and Levit is an example of an inhomogeneous random graph of the type studied by Bollob´as, Janson and Riordan, which enables us to gi...
114
Voted
PEPM
2007
ACM
15 years 6 months ago
2007
ACM
Functional Reactive Programming (frp) extends traditional functional programming with dataflow evaluation, making it possible to write interactive programs in a declarative style...
109
Voted
STOC
2000
ACM
15 years 5 months ago
2000
ACM
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
126
Voted
SPAA
2005
ACM
15 years 6 months ago
2005
ACM
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
85
Voted
STOC
2002
ACM
16 years 1 months ago
2002
ACM
We analyze a randomized version of the Brelaz heuristic on sparse random graphs. We prove that almost all graphs with average degree dp4:03; i.e., G?n; p ? d=n?; are 3-colorable a...