4 citations · 4 across the 6 of their papers we have counts for
6 papers
Valid path-based graph vertex numbering
Les Foulds, Humberto J. Longo
A labelling of a graph is an assignment of labels to its vertex or edge sets (or both), subject to certain conditions, a well established concept. A labelling of a graph G of order…
Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs
Márcia R. Cappelle, Erika Coelho, Les R. Foulds +1
Let be a finite simple undirected graph with vertex set , edge set and vertex subset . is termed \emph{open-dominating} if every v…
Assembly line balancing with task division
Carlos Alexandre X. Silva, Les Foulds, Humberto J. Longo
In a commonly-used version of the Simple Assembly Line Balancing Problem (SALBP-1) tasks are assigned to stations along an assembly line with a fixed cycle time in order to minimiz…
A note on searching sorted unbalanced three-dimensional arrays
Márcia R. Cappelle, Les Foulds, Humberto J. Longo
We examine the problem of searching sequentially for a desired real value (a key) within a sorted unbalanced three-dimensional finite real array. This classic problem can be viewed…
A GPU-based parallel algorithm for enumerating all chordless cycles in graphs
Elisângela Silva Dias, Diane Castonguay, Humberto Longo +2
In a finite undirected simple graph, a chordless cycle is an induced subgraph which is a cycle. We propose a GPU parallel algorithm for enumerating all chordless cycles of such a g…
Efficient Enumeration of Chordless Cycles
Elisângela Silva Dias, Diane Castonguay, Humberto Longo +1
In a finite undirected simple graph, a {\it chordless cycle} is an induced subgraph which is a cycle. We propose two algorithms to enumerate all chordless cycles of such a graph. C…