Browsing by Subject Combinatorial optimization
Showing results 1 to 8 of 8
Issue Date | Title | Author(s) | Type | Access Type |
Apr-2012 | Approximating the maximum size of a k-regular induced subgraph by an upper bound on the co-k-plex number | Luz, C.J. | article | |
Jan-2016 | A characterization of the weighted Lovász number based on convex quadratic programming | Luz, Carlos J. | article | |
31-Dec-2015 | A characterization of the weighted version of McEliece-Rodemich-Rumsey-Schrijver number based on convex quadratic programming | Luz, Carlos J. | article | |
2015 | Determination of (0,2)-regular sets in graphs and applications | Cardoso, Domingos M.; Luz, C. J.; Pacheco, Maria de Fátima | bookPart | |
1998 | A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph | Luz, C. J.; Cardoso, Domingos M. | article | |
2009 | Solving huge size instances of the optimal diversity management problem | Agra, A.; Cardoso, D.M.; Cerdeira, J.O.; Miranda, M.; Rocha, E. | article | |
Mar-2017 | Spectral bounds for the k-regular induced subgraph problem | Cardoso, Domingos Moreira; Pinheiro, Sofia J. | bookPart | |
11-May-2017 | The k-regular induced subgraph problem | Agra, Agostinho; Dahl, Geir; Haufmann, Torkel A.; Pinheiro, Sofia J. | article | |