37 citations · 115 across the 24 of their papers we have counts for
4 papers · 1 filter
Empirical Evaluation of Project Scheduling Algorithms for Maximization of the Net Present Value
Isac M. Lacerda, Eber A. Schmitz, Jayme L. Szwarcfiter +1
This paper presents an empirical performance analysis of three project scheduling algorithms dealing with maximizing projects' net present value with unrestricted resources. The se…
Graphs whose vertices of degree at least 2 lie in a triangle
Vinicius L. do Forte, Min Chih Lin, Abilio Lucena +3
A pendant vertex is one of degree one and an isolated vertex has degree zero. A neighborhood star-free (NSF for short) graph is one in which every vertex is contained in a triangle…
Edge Intersection Graphs of Paths on a Triangular Grid
Vitor T. F. de Luca, María Pía Mazzoleni, Fabiano S. Oliveira +2
We introduce a new class of intersection graphs, the edge intersection graphs of paths on a triangular grid, called EPGt graphs. We show similarities and differences from this new…
Weighted Connected Matchings
Guilherme C. M. Gomes, Bruno P. Masquio, Paulo E. D. Pinto +2
A matching is a -matching if the subgraph induced by the endpoints of the edges of satisfies property . As examples, for appropriate choices of $\…