Showing cs.DMShow all
2 papers · 1 filter
cs.DM2021
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…
cs.DM2017
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…