Search Results

There are 12195 results for: content related to: The Complexity of the Exact Weighted Independent Set Problem

  1. Maximum Clique, Maximum Independent Set, and Graph Coloring Problems

    Standard Article

    Wiley Encyclopedia of Operations Research and Management Science

    Jeff Pattillo and Sergiy Butenko

    Published Online : 14 JAN 2011, DOI: 10.1002/9780470400531.eorms0146

  2. Maximum common subgraph isomorphism algorithms and their applications in molecular science: a review

    Wiley Interdisciplinary Reviews: Computational Molecular Science

    Volume 1, Issue 1, January/February 2011, Pages: 68–79, Hans-Christian Ehrlich and Matthias Rarey

    Version of Record online : 21 JAN 2011, DOI: 10.1002/wcms.5

  3. Network-Based Data Mining: Operations Research Techniques and Applications

    Standard Article

    Wiley Encyclopedia of Operations Research and Management Science

    Vladimir Boginski

    Published Online : 15 FEB 2011, DOI: 10.1002/9780470400531.eorms0565

  4. Maximum cut-clique problem: ILS heuristics and a data analysis application

    International Transactions in Operational Research

    Volume 22, Issue 5, September 2015, Pages: 775–809, Pedro Martins, Antonio Ladrón and Helena Ramalhinho

    Version of Record online : 5 SEP 2014, DOI: 10.1111/itor.12120

  5. A branch-and-price approach for the maximum weight independent set problem

    Networks

    Volume 46, Issue 4, December 2005, Pages: 198–209, Deepak Warrier, Wilbert E. Wilhelm, Jeffrey S. Warren and Illya V. Hicks

    Version of Record online : 13 OCT 2005, DOI: 10.1002/net.20088

  6. An analysis of parameter adaptation in reactive tabu search

    International Transactions in Operational Research

    Volume 21, Issue 1, January 2014, Pages: 127–152, Franco Mascia, Paola Pellegrini, Mauro Birattari and Thomas Stützle

    Version of Record online : 15 AUG 2013, DOI: 10.1111/itor.12043

  7. A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs

    Journal of Graph Theory

    Petr A. Golovach, Matthew Johnson, Daniël Paulusma and Jian Song

    Version of Record online : 2 MAR 2016, DOI: 10.1002/jgt.22028

  8. On the Iterated Biclique Operator

    Journal of Graph Theory

    Volume 73, Issue 2, June 2013, Pages: 181–190, Marina Groshaus and Leandro P. Montero

    Version of Record online : 3 AUG 2012, DOI: 10.1002/jgt.21666

  9. You have free access to this content
    A tutorial on branch and cut algorithms for the maximum stable set problem

    International Transactions in Operational Research

    Volume 19, Issue 1-2, January / March 2012, Pages: 161–199, Steffen Rebennack, Gerhard Reinelt and Panos M. Pardalos

    Version of Record online : 27 FEB 2013, DOI: 10.1111/j.1475-3995.2011.00805.x

  10. Iterated clique graphs with increasing diameters

    Journal of Graph Theory

    Volume 28, Issue 3, July 1998, Pages: 147–154, Claudson F. Bornstein and Jayme L. Szwarcfiter

    Version of Record online : 7 DEC 1998, DOI: 10.1002/(SICI)1097-0118(199807)28:3<147::AID-JGT4>3.0.CO;2-K

  11. Subgraph-avoiding coloring of graphs

    Journal of Graph Theory

    Volume 63, Issue 4, April 2010, Pages: 300–310, Jia Shen

    Version of Record online : 29 MAY 2009, DOI: 10.1002/jgt.20428

  12. Clique Relaxations

    Standard Article

    Wiley Encyclopedia of Operations Research and Management Science

    Benjamin McClosky

    Published Online : 15 FEB 2011, DOI: 10.1002/9780470400531.eorms0145

  13. A simple and efficient branch and bound algorithm for finding a maximum clique with experimental evaluations

    Systems and Computers in Japan

    Volume 28, Issue 5, May 1997, Pages: 60–67, Etsuji Tomita, Ken'ichi Imamatsu, Yasuhiro Kohata and Mitsuo Wakatsuki

    Version of Record online : 7 DEC 1998, DOI: 10.1002/(SICI)1520-684X(199705)28:5<60::AID-SCJ7>3.0.CO;2-M

  14. On provably best construction heuristics for hard combinatorial optimization problems

    Networks

    Volume 67, Issue 3, May 2016, Pages: 238–245, Sera Kahruman-Anderoglu, Austin Buchanan, Sergiy Butenko and Oleg A. Prokopyev

    Version of Record online : 1 JUL 2015, DOI: 10.1002/net.21620

  15. Linear Clique-Width for Hereditary Classes of Cographs

    Journal of Graph Theory

    Robert Brignall, Nicholas Korpelainen and Vincent Vatter

    Version of Record online : 28 MAR 2016, DOI: 10.1002/jgt.22037

  16. You have free access to this content
    General Bibliography

    Paradigms of Combinatorial Optimization, 2nd Edition

    Vangelis Th. Paschos, Pages: 707–765, 2014

    Published Online : 8 AUG 2014, DOI: 10.1002/9781119005353.biblio

  17. Graph relations, clique divergence and surface triangulations

    Journal of Graph Theory

    Volume 51, Issue 2, February 2006, Pages: 110–122, F. Larrión, V. Neumann-Lara and M.A. Pizaña

    Version of Record online : 21 OCT 2005, DOI: 10.1002/jgt.20126

  18. Clique-coloring some classes of odd-hole-free graphs

    Journal of Graph Theory

    Volume 53, Issue 3, November 2006, Pages: 233–249, David Défossez

    Version of Record online : 1 AUG 2006, DOI: 10.1002/jgt.20177

  19. On independent sets in random graphs

    Random Structures & Algorithms

    Volume 47, Issue 3, October 2015, Pages: 436–486, Amin Coja-Oghlan and Charilaos Efthymiou

    Version of Record online : 30 MAY 2014, DOI: 10.1002/rsa.20550

  20. Weighted vertex packing problem for specially structured geometric graphs

    Naval Research Logistics (NRL)

    Volume 42, Issue 1, February 1995, Pages: 81–102, Gang Yu, Panagiotis Kouvelis and Songjun Luo

    Version of Record online : 11 OCT 2006, DOI: 10.1002/1520-6750(199502)42:1<81::AID-NAV3220420108>3.0.CO;2-X