0000000000256420
AUTHOR
Antonio Napoletano
Tabu search for min-max edge crossing in graphs
Abstract Graph drawing is a key issue in the field of data analysis, given the ever-growing amount of information available today that require the use of automatic tools to represent it. Graph Drawing Problems (GDP) are hard combinatorial problems whose applications have been widely relevant in fields such as social network analysis and project management. While classically in GDPs the main aesthetic concern is related to the minimization of the total sum of crossing in the graph (min-sum), in this paper we focus on a particular variant of the problem, the Min-Max GDP, consisting in the minimization of the maximum crossing among all egdes. Recently proposed in scientific literature, the Min…
Limberg fasciocutaneous transposition flap for the coverage of an exposed hip implant in a patient affected by ewing sarcoma
Highlights • Hemipelvectomy with immediate reconstruction with prosthetic devices for the surgical treatment of malignant tumors is an invasive procedure. • The treatment of an exposed hip implant in these cluster of patient is extremely challenging and the literature shows how negative pressure wound therapy and myocutaneous, both pedicled and free, flaps are workhorses in these situations. • The literature shows that the gold standard in the coverage of exposed prosthetic devices and in the treatment of infected non healing wounds is represented by muscular or myocutaneous flap. • In this paper we report a successful coverage of exposed prosthetic hip implant with a local fasciocutaneous …
Heuristics for the Constrained Incremental Graph Drawing Problem
Abstract Visualization of information is a relevant topic in Computer Science, where graphs have become a standard representation model, and graph drawing is now a well-established area. Within this context, edge crossing minimization is a widely studied problem given its importance in obtaining readable representations of graphs. In this paper, we focus on the so-called incremental graph drawing problem, in which we try to preserve the user’s mental map when obtaining successive drawings of the same graph. In particular, we minimize the number of edge crossings while satisfying some constraints required to preserve the position of vertices with respect to previous drawings. We propose heur…