4 citations · 5 across the 6 of their papers we have counts for
7 papers
Computing a 3-role assignment is polynomial-time solvable on complementary prisms
Diane Castonguay, Elisângela S. Dias, Fernanda N. Mesquita +1
A -role assignment of a simple graph is an assignment of distinct roles to the vertices of , such that two vertices with the same role have the same set of roles assi…
Results for the maximum weight planar subgraph problem
Diane Castonguay, Elisângela Silva Dias, Leslie Richard Foulds
The problem of finding the maximum-weight, planar subgraph of a finite, simple graph with nonnegative real edge weights is well known in industrial and electrical engineering, syst…
Polynomial recognition of cluster algebras of finite type
Elisângela Silva Dias, Diane Castonguay
Cluster algebras are a recent topic of study and have been shown to be a useful tool to characterize structures in several knowledge fields. An important problem is to establish wh…
Polynomial enumeration of chordless cycles on cyclically orientable graphs
Elisângela Silva Dias, Diane Castonguay
In a finite undirected simple graph, a chordless cycle is an induced subgraph which is a cycle. A graph is called cyclically orientable if it admits an orientation in which every c…
Algorithms and Properties for Positive Symmetrizable Matrices
Elisângela Silva Dias, Diane Castonguay, Mitre Costa Dourado
Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in…
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…