Publicação

Algorithmic strategies for the recognition of graphs with convex quadratic stability number

Detalhes bibliográficos
Resumo:	A major difficulty in the recognition of graphs with convex quadratic stability number is the existence of adverse subgraphs (an adverse subgraph is a subgraph such that the smallest eigenvalue of its adjacency matrix doesn’t change when any vertex or the neighbourhood of any vertex is deleted). It is a challenge to find adverse graphs without convex quadratic stability number. We present the main results about graphs with convex quadratic stability number and conclusions about the existence of adverse subgraphs belonging to this family in certain classes of graphs.
Autores principais:	Pacheco, Maria F.
Outros Autores:	Luz, Carlos J.; Cardoso, Domingos M.
Assunto:	Convex optimization Combinatorial optimization
Ano:	2010
País:	Portugal
Tipo de documento:	documento de conferência
Tipo de acesso:	acesso aberto
Instituição associada:	Instituto Politécnico de Bragança
Idioma:	inglês
Origem:	Biblioteca Digital do IPB

Registos relacionados

Algorithmic strategies for the recognition of graphs with convex quadratic stability number
por: Pacheco, Maria F.
Publicado em: (2010)

Recognition of graphs with convex quadratic stability number
por: Pacheco, Maria F.
Publicado em: (2009)

A survey on graphs with convex quadratic stability number
por: Cardoso, Domingos M.
Publicado em: (2020)

Recognition of graphs with convex quadratic stability number
por: Pacheco, Maria de Fátima Moreira da Silva
Publicado em: (2019)

Recent results on graphs with convex quadratic stability number
por: Pacheco, Maria F.
Publicado em: (2009)

A characterization of the weighted Lovász number based on convex quadratic programming
por: Luz, Carlos J.
Publicado em: (2016)

A heuristic for the stability number of a graph based on convex quadratic programming and tabu search
por: Cavique, Luís
Publicado em: (2009)

Maximum matching by convex quadratic programming based o an adverse graph conjecture
por: Pacheco, Maria F.
Publicado em: (2012)

Convex sets strict separation in Hilbert spaces
por: Ferreira, M. A. M.
Publicado em: (2014)

Convex quadratic programming applied to the stability number of a graph
por: Pacheco, Maria F.
Publicado em: (2012)

A characterization of the weighted version of McEliece-Rodemich-Rumsey-Schrijver number based on convex quadratic programming
por: Luz, Carlos J.
Publicado em: (2015)

Determination of (0,2)-regular sets in graphs and applications
por: Cardoso, Domingos M.
Publicado em: (2015)

A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization
por: Oviedo, Harry
Publicado em: (2022)

A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph
por: Luz, C. J.
Publicado em: (1998)

Sensing Cloud Optimization applied to a non-convex constrained economical dispatch
por: Fonte, Pedro M
Publicado em: (2013)

An existence result for non-convex optimal control problems
por: Carlota, Clara
Publicado em: (2015)

On hereditary properties of the class of graphs with convex quadratic stability number
por: Cardoso, D. M.
Publicado em: (2012)

Kuhn-Tucker’s theorem: The fundamental result in convex programming applied to finance and economic sciences
por: Ferreira, Manuel Alberto M.
Publicado em: (2012)

The graph bisection minimization problem
por: Luz,Carlos J.
Publicado em: (2003)

Multiobjective optimization of classifiers by means of 3D convex-hull-based evolutionary algorithms
por: Zhao, Jiaqi
Publicado em: (2016)

Multiobjective optimization of classifiers by means of 3-D convex Hull based evolutionary algorithms
por: Zhao, J.
Publicado em: (2016)

3D fast convex-hull-based evolutionary multiobjective optimization algorithm
por: Zhao, Jiaqi
Publicado em: (2018)

3D fast convex-hull-based evolutionary multiobjective optimization algorithm
por: Zhao, J.
Publicado em: (2018)

Application of 2D packing algorithms to the woodwork industry
por: Ribeiro, Tiago
Publicado em: (2022)

Towards a high-performance implementation of the MCSFilter optimization algorithm
por: Araújo, Leonardo Oliveira
Publicado em: (2021)

On the algorithm of determination of immobile indices for convex SIP problems
por: Kostyukova, Olga I.
Publicado em: (2008)

Convex Quadratic Programming Approach to the Maximum Matching Problem
por: Cardoso, Domingos M.
Publicado em: (2001)

New stabilization procedures for the cutting stock problem
por: Clautiaux, François
Publicado em: (2011)

New approach to the optimization problem
por: Amaral, João Ferreira do
Publicado em: (2021)

Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices
por: Kostyukova, O. I.
Publicado em: (2010)

Solving huge size instances of the optimal diversity management problem
por: Agra, A.
Publicado em: (2009)

A hybrid heuristic based on column generation for two- and three- stage bin packing problems
por: Alvelos, Filipe Pereira e
Publicado em: (2014)

The Role of Non-Negative Polynomials For Rank-One Convexity and Quasi Convexity
por: Bandeira, Luís
Publicado em: (2017)

Graphs with least eigenvalue -2 attaining a convex quadratic upper bound for the stability number
por: Cardoso, Domingos M.
Publicado em: (2006)

Comparison of Combinatorial and Continuous Frameworks for the Beam Angle Optimization Problem in IMRT
por: Rocha, Humberto
Publicado em: (2018)

Comparison of Combinatorial and Continuous Frameworks for the Beam Angle Optimization Problem in IMRT
por: Rocha, Humberto
Publicado em: (2018)

Systematic method for designing constellations for intensity-modulated optical system
por: Dinis, Rui
Publicado em: (2014)

A simplex like approach based on star sets for recognizing convex-QP adverse graphs
por: Cardoso, Domingos M.
Publicado em: (2016)

Sufficient optimality conditions for convex semi-infinite programming
por: Kostyukova, O. I.
Publicado em: (2010)

Optimality Conditions for Convex Semi-infinite Programming Problems with Finitely Representable Compact Index Sets
por: Kostyukova, O.
Publicado em: (2017)