Search Results - "Martinhon, Carlos A."

On paths, trails and closed trails in edge-colored graphs by Gourvès, Laurent, Lyra, Adria, Martinhon, Carlos A., Monnot, Jérôme

“…Graph Theory In this paper we deal from an algorithmic perspective with different questions regarding properly edge-colored (or PEC) paths, trails and closed…”
Get full text

The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles by Faria, Luerbio, Gourvès, Laurent, Martinhon, Carlos A., Monnot, Jérôme

“…We introduce a number of problems regarding edge-color modifications in edge-colored graphs and digraphs. Consider a property π, a c-edge-colored graph Gc not…”
Get full text

Complexity of trails, paths and circuits in arc-colored digraphs by Gourvès, Laurent, Lyra, Adria, Martinhon, Carlos A., Monnot, Jérôme

“…We deal with different algorithmic questions regarding properly arc-colored s–t trails, paths and circuits in arc-colored digraphs. Given an arc-colored…”
Get full text

Near-optimal solutions for the generalized max-controlled set problem by Santos, Ivairton M., Martinhon, Carlos A., Ochi, Luiz S.

“…In this work we deal with sandwich graphs G=( V, E) and present the notion of vertices f-controlled by a subset M ⊆ V . We introduce the generalized…”
Get full text

Randomized generation of acyclic orientations upon anonymous distributed systems by Arantes, Gladstone M., França, Felipe M.G., Martinhon, Carlos A.

“…This paper presents two new randomized distributed algorithms for the generation of acyclic orientations upon anonymous distributed systems of arbitrary…”
Get full text

Ranking using η-efficiency and relative size measures based on DEA by Kanematsu, Simon Y., Carvalho, Ney P., Martinhon, Carlos A., Almeida, Mariana R.

“…•We propose a non-parametric approach to define the size of organizations or Decision Making Units (DMUs).•We introduce a relative size measure based on…”
Get full text

The Generalized Max-Controlled Set Problem by Santos, Ivairton M., Martinhon, Carlos A., Ochi, Luiz S.

“…In this work we deal with sandwich graphs G = ( V , E ) and present the notion of vertices f-controlled by a subset M ⊆ V . We introduce the generalized…”
Get full text

Reduction Rules for the Covering Tour Problem by Motta, Luciene C.S., Ochi, Luiz Satoru, Martinhon, Carlos A.

“…The Covering Tour Problem (CTP) is a generalization of the Traveling Salesman Problem (TSP) which has several actual applications. It is denned on an…”
Get full text