Search Results - "Faria, Luerbio"

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

An improved upper bound on the crossing number of the hypercube by Faria, Luerbio, Herrera de Figueiredo, Celina Miraglia, Sýkora, Ondrej, Vrt'o, Imrich

“…We draw the n‐dimensional hypercube in the plane with ${5\over 32}4^{n}-\lfloor{{{n}^{2}+1}\over 2}}\rfloor {2}^{n-2}$ crossings, which improves the previous…”
Get full text

On the probe problem for (r,ℓ)-well-coveredness: Algorithms and complexity by Faria, Luerbio, Souza, Uéverton S.

“…•A graph G=(V,E) is C-probe if V(G) can be partitioned into two sets: non-probesN and probesP, where N is an independent set and new edges may be added between…”
Get full text

Results about the total chromatic number and the conformability of some families of circulant graphs by Faria, Luerbio, Nigro, Mauro, Preissmann, Myriam, Sasaki, Diana

“…In this paper, we show that with the exception of the graph C12(1,3), which we prove to be Type 2, all members of the following three infinite families of…”
Get full text

Partitions and well-coveredness: The graph sandwich problem by Alves, Sancrey R., Couto, Fernanda, Faria, Luerbio, Gravier, Sylvain, Klein, Sulamita, Souza, Uéverton S.

“…A graph G is well-covered if every maximal independent set of G is maximum. A (k,ℓ)-partition of a graph G is a partition of its vertex set into k independent…”
Get full text

On complexities of minus domination by Faria, Luérbio, Hon, Wing-Kai, Kloks, Ton, Liu, Hsiang-Hsuan, Wang, Tao-Ming, Wang, Yue-Li

“…A function f:V→{−1,0,1} is a minus-domination function of a graph G=(V,E) if the values over the vertices in each closed neighborhood sum to a positive number…”
Get full text

Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion by Baste, Julien, Faria, Luerbio, Klein, Sulamita, Sau, Ignasi

“…For two integers r , ℓ ≥ 0, a graph G = ( V , E ) is an ( r , ℓ )-graph if V can be partitioned into r independent sets and ℓ cliques. In the parameterized ( r…”
Get full text

Chordal-(2,1) graph sandwich problem with boundary conditions by Couto, Fernanda, Faria, Luerbio, Gravier, Sylvain, Klein, Sulamita

“…In this work, we consider the graph sandwich problem for a property Π, a decision problem proposed by Golumbic, Kaplan, and Shamir as follows: given two graphs…”
Get full text

Optimizing concurrency under Scheduling by Edge Reversal by Marciano, Carlos E., Arantes, Gladstone M., Lucena, Abilio, Simonetti, Luidi G., Faria, Luerbio, França, Felipe M. G.

“…Scheduling by Edge Reversal provides an order of operation for nodes in a graph, but maximizing or minimizing the resulting concurrency is hard. In this paper,…”
Get full text

Improved kernels for Signed Max Cut parameterized above lower bound on (r,l)-graphs by Faria, Luerbio, Klein, Sulamita, Sau, Ignasi, Sucupira, Rubens

“…A graph GG is signed if each edge is assigned ++ or −−. A signed graph is balanced if there is a bipartition of its vertex set such that an edge has sign −− if…”
Get full text

Preface: LAGOS’13: Seventh Latin-American Algorithms, Graphs, and Optimization Symposium, Playa del Carmen, México — 2013 by Durán, Guillermo, Faria, Luerbio, Pizaña, Miguel, Salazar, Gelasio

Get full text

Chordal- (k,ℓ)and strongly chordal- (k,ℓ)graph sandwich problems by Couto, Fernanda, Faria, Luerbio, Klein, Sulamita

“…Background In this work, we consider the graph sandwich decision problem for property Π , introduced by Golumbic, Kaplan and Shamir: given two graphs G 1 =( V…”
Get full text

Forbidden subgraphs and the König–Egerváry property by Bonomo, Flavia, Dourado, Mitre C., Durán, Guillermo, Faria, Luerbio, Grippo, Luciano N., Safe, Martín D.

“…The matching number of a graph is the maximum size of a set of vertex-disjoint edges. The transversal number is the minimum number of vertices needed to meet…”
Get full text

Maximum Cuts in Edge-colored Graphs by Sucupira, Rubens, Faria, Luerbio, Klein, Sulamita, Sau, Ignasi, Souza, Uéverton S.

“…The input of the Maximum Colored Cut problem consists of a graph G=(V,E) with an edge-coloring c:E→{1,2,3,…,p} and a positive integer k>0, and the question is…”
Get full text

Improved kernels for Signed Max Cut parameterized above lower bound on (r,l)-graphs by Luerbio Faria, Sulamita Klein, Ignasi Sau, Rubens Sucupira

“…A graph $G$ is signed if each edge is assigned $+$ or $-$. A signed graph is balanced if there is a bipartition of its vertex set such that an edge has sign…”
Get full text

Split clique graph complexity by Alcón, Liliana, Faria, Luerbio, de Figueiredo, Celina M.H., Gutierrez, Marisa

“…A complete set of a graph G is a subset of vertices inducing a complete subgraph. A clique is a maximal complete set. Denote by C(G) the clique family of G…”
Get full text

The (k,ℓ) unpartitioned probe problem NP-complete versus polynomial dichotomy by Dantas, Simone, Faria, Luerbio, de Figueiredo, Celina M.H., Teixeira, Rafael B.

“…A graph G=(V,E) is Cprobe if V can be partitioned into two sets, probes P and non-probes N, where N is independent and new edges may be added between…”
Get full text

The Same Upper Bound for Both: The 2-page and the Rectilinear Crossing Numbers of the n-Cube by Faria, Luerbio, de Figueiredo, Celina M. H., Richter, R. Bruce, Vrt'o, Imrich

“…We present two main results: a 2‐page and a rectilinear drawing of the n‐dimensional cube Qn. Both drawings have the same number 1257684n−2n−33(3n2+9+(−1)n+12)…”
Get full text

Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs by Coelho, Hebert, Faria, Luerbio, Gravier, Sylvain, Klein, Sulamita

“…An oriented k-coloring of an oriented graph G→=(V,E→) is a partition of V into k subsets such that there are no two adjacent vertices belonging to the same…”
Get full text

On defensive alliances and strong global offensive alliances by Dourado, Mitre C., Faria, Luerbio, Pizaña, Miguel A., Rautenbach, Dieter, Szwarcfiter, Jayme L.

“…We consider complexity issues and upper bounds for defensive alliances and strong global offensive alliances in graphs. We prove that it is NP-complete to…”
Get full text