Buscar

Mostrando ítems 1-10 de 18

Polyhedral study of the maximum common induced subgraph problem

Piva, Breno; Souza, Cid Carvalho de (Springer, 2016)

Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs

Alcón, Liliana Graciela; Gutiérrez, Marisa; Mazzoleni, María Pía (2015)

The maximum common edge subgraph problem: A polyhedral investigation

Bahiense, L; Manic, G; Piva, B; de Souza, CC (Elsevier Science BvAmsterdamHolanda, 2012)

Structural matching of 2D electrophoresis gels using deformed graphs

NOMA, Alexandre; PARDO, Alvaro; CESAR JR., Roberto M. (ELSEVIER SCIENCE BV, 2011)

2D electrophoresis is a well-known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation and the goal is to perform a differential ...

A Branch&cut Algorithm For The Maximum Common Edge Subgraph Problem

Manic G.; Bahiense L.; de Souza C. (, 2009)

Estudo poliedral do problema do máximo subgrafo induzido comumPolyhedral study of the maximum common induced subgraph problem

Piva, Breno (2016)

Estudo poliedral do problema do maximo subgrafo induzido comumPolyhedral study of the maximum common induced subgraph problem

Piva, Breno, 1983- ([s.n.], 2009)

EPT graphs on bounded degree trees

Alcón, Liliana Graciela; Gutiérrez, Marisa; Mazzoleni, María Pía (2014)

On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs

Alcón, Liliana Graciela; Faria, L.; Figueiredo, C. M. H. de; Gutiérrez, Marisa (2010)

On minimal non [h, 2, 1] graphs

Alcón, Liliana Graciela; Gutiérrez, Marisa; Mazzoleni, María Pía (2013)