38 citations · 464 across the 71 of their papers we have counts for
4 papers · 2 filters
A study of the edge-switching Markov-chain method for the generation of random graphs
Alexandre O. Stauffer, Valmir C. Barbosa
We study the problem of generating connected random graphs with no self-loops or multiple edges and that, in addition, have a given degree sequence. The generation method we focus…
Acyclic orientations with path constraints
Rosa M. V. Figueiredo, Valmir C. Barbosa, Nelson Maculan +1
Many well-known combinatorial optimization problems can be stated over the set of acyclic orientations of an undirected graph. For example, acyclic orientations with certain diamet…
6-cycle double covers of cubic graphs
Rodrigo S. C. Leao, Valmir C. Barbosa
A cycle double cover (CDC) of an undirected graph is a collection of the graph's cycles such that every edge of the graph belongs to exactly two cycles. We describe a constructive…
Minimal chordal sense of direction and circulant graphs
R. S. C. Leao, V. C. Barbosa
A sense of direction is an edge labeling on graphs that follows a globally consistent scheme and is known to considerably reduce the complexity of several distributed problems. In…