[HTML][HTML] A multilevel bilinear programming algorithm for the vertex separator problem
Abstract The Vertex Separator Problem for a graph is to find the smallest collection of
vertices whose removal breaks the graph into two disconnected subsets that satisfy …
vertices whose removal breaks the graph into two disconnected subsets that satisfy …
Byzantine broadcast with fixed disjoint paths
A Maurer, S Tixeuil - Journal of Parallel and Distributed Computing, 2014 - Elsevier
We consider the problem of reliably broadcasting a message in a multihop network. We
assume that some nodes may be Byzantine, and behave arbitrarily. We focus on …
assume that some nodes may be Byzantine, and behave arbitrarily. We focus on …
[PDF][PDF] A Multilevel Vertex Separator Algorithm Based on the Solution of Bilinear Programs
A Multilevel Vertex Separator Algorithm Based on the Solution of Bilinear Programs Page 1 A
Multilevel Vertex Separator Algorithm Based on the Solution of Bilinear Programs William …
Multilevel Vertex Separator Algorithm Based on the Solution of Bilinear Programs William …