13 search results - page 1 / 3 » Construction of Some Uncountable 2-Arc-Transitive Bipartite ... |
ORDER
2008
13 years 4 months ago
2008
We give various constructions of uncountable arc-transitive bipartite graphs employing techniques from partial orders, starting with the cyclefree case, but generalizing to cases ...
GECCO
2008
Springer
13 years 6 months ago
2008
Springer
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
A drawing of a plane graph is called an inner rectangular drawing if every edge is drawn as a horizontal or vertical line segment so that every inner face is a rectangle. An inner ...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
DCG
2011
12 years 12 months ago
2011
We examine the generic local and global rigidity of various graphs in Rd . Bruce Hendrickson showed that some necessary conditions for generic global rigidity are (d + 1)-connected...