We give various constructions of uncountable arc-transitive bipartite graphs employing techniques from partial orders, starting with the cyclefree case, but generalizing to cases ...
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...
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 ...
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...
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sud...
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...