Search Results

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

  1. r-domination problems on homogeneously orderable graphs

    Networks

    Volume 30, Issue 2, September 1997, Pages: 121–131, Feodor F. Dragan and Falk Nicolai

    Article first published online : 7 DEC 1998, DOI: 10.1002/(SICI)1097-0037(199709)30:2<121::AID-NET6>3.0.CO;2-E

  2. Homogeneous sets and domination: A linear time algorithm for distance—hereditary graphs

    Networks

    Volume 37, Issue 3, May 2001, Pages: 117–128, Falk Nicolai and Thomas Szymczak

    Article first published online : 28 MAR 2001, DOI: 10.1002/net.1

  3. Hereditary Efficiently Dominatable Graphs

    Journal of Graph Theory

    Volume 73, Issue 4, August 2013, Pages: 400–424, Martin Milanič

    Article first published online : 16 JUL 2012, DOI: 10.1002/jgt.21685

  4. Perfect coloring and linearly χ-bound P6-free graphs

    Journal of Graph Theory

    Volume 54, Issue 4, April 2007, Pages: 293–306, S. A. Choudum, T. Karthick and M. A. Shalu

    Article first published online : 27 OCT 2006, DOI: 10.1002/jgt.20212

  5. The complexity of the matching-cut problem for planar graphs and other graph classes

    Journal of Graph Theory

    Volume 62, Issue 2, October 2009, Pages: 109–126, Paul Bonsma

    Article first published online : 13 APR 2009, DOI: 10.1002/jgt.20390

  6. You have free access to this content
    On tree 3-spanners in directed path graphs

    Networks

    Volume 50, Issue 3, October 2007, Pages: 203–210, B.S. Panda and Anita Das

    Article first published online : 24 JUL 2007, DOI: 10.1002/net.20198

  7. Complexity and Approximation Results for the Min Weighted Node Coloring Problem

    Combinatorial Optimization and Theoretical Computer Science

    Marc Demange, Bruno Escoffier, Jérǒme Monnot, Vangelis Th. Paschos, Dominique de Werra, Pages: 259–289, 2010

    Published Online : 3 FEB 2010, DOI: 10.1002/9780470611098.ch10

  8. Biclique graphs and biclique matrices

    Journal of Graph Theory

    Volume 63, Issue 1, January 2010, Pages: 1–16, Marina Groshaus and Jayme L. Szwarcfiter

    Article first published online : 25 AUG 2009, DOI: 10.1002/jgt.20442

  9. Strong clique trees, neighborhood trees, and strongly chordal graphs

    Journal of Graph Theory

    Volume 33, Issue 3, March 2000, Pages: 151–160, Terry A. McKee

    Article first published online : 25 JAN 2000, DOI: 10.1002/(SICI)1097-0118(200003)33:3<151::AID-JGT5>3.0.CO;2-U

  10. On the Iterated Biclique Operator

    Journal of Graph Theory

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

    Article first published online : 3 AUG 2012, DOI: 10.1002/jgt.21666

  11. Clique-inverse graphs of K3-free and K4-free graphs

    Journal of Graph Theory

    Volume 35, Issue 4, December 2000, Pages: 257–272, Fábio Protti and Jayme L. Szwarcfiter

    Article first published online : 27 OCT 2000, DOI: 10.1002/1097-0118(200012)35:4<257::AID-JGT3>3.0.CO;2-4

  12. A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs

    Networks

    Volume 31, Issue 3, May 1998, Pages: 177–182, Andreas Brandstädt and Feodor F. Dragan

    Article first published online : 7 DEC 1998, DOI: 10.1002/(SICI)1097-0037(199805)31:3<177::AID-NET4>3.0.CO;2-C

  13. The Maximum Number of Dominating Induced Matchings

    Journal of Graph Theory

    Min Chih Lin, Veronica A. Moyano, Dieter Rautenbach and Jayme L. Szwarcfiter

    Article first published online : 2 MAY 2014, DOI: 10.1002/jgt.21804

  14. On the power of BFS to determine a graph's diameter

    Networks

    Volume 42, Issue 4, December 2003, Pages: 209–222, Derek G. Corneil, Feodor F. Dragan and Ekkehard Köhler

    Article first published online : 10 SEP 2003, DOI: 10.1002/net.10098

  15. Interval bigraphs and circular arc graphs

    Journal of Graph Theory

    Volume 46, Issue 4, August 2004, Pages: 313–327, Pavol Hell and Jing Huang

    Article first published online : 30 APR 2004, DOI: 10.1002/jgt.20006

  16. 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

  17. Some extremal results in cochromatic and dichromatic theory

    Journal of Graph Theory

    Volume 15, Issue 6, December 1991, Pages: 579–585, Paul Erdös, John Gimbel and Dieter Kratsch

    Article first published online : 5 OCT 2006, DOI: 10.1002/jgt.3190150604

  18. The recognition of indifference digraphs and generalized semiorders

    Journal of Graph Theory

    Volume 21, Issue 2, February 1996, Pages: 235–241, George Steiner

    Article first published online : 7 DEC 1998, DOI: 10.1002/(SICI)1097-0118(199602)21:2<235::AID-JGT14>3.0.CO;2-I

  19. 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

  20. A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs

    Networks

    Volume 50, Issue 4, December 2007, Pages: 231–240, Katerina Asdre and Stavros D. Nikolopoulos

    Article first published online : 4 SEP 2007, DOI: 10.1002/net.20200