/

Graph Classes A Survey

Brandstädt, Andreas Le Van Bang Spinrad Jeremy P.
Heftet / 1999 / Engelsk

Produktdetaljer

ISBN
9780898714326
Publisert
1999-06-30
Utgiver
Society for Industrial & Applied Mathematics,U.S.; Society for Industrial & Applied Mathematics,U.S.
Vekt
580 gr
Høyde
228 mm
Bredde
151 mm
Dybde
13 mm
Aldersnivå
P, 06
Språk
Product language
Engelsk
Format
Product format
Heftet
Antall sider
315

Forfatter
Brandstädt, Andreas
Le Van Bang
Spinrad Jeremy P.

Graph Classes A Survey

Brandstädt, Andreas Le Van Bang Spinrad Jeremy P.
Heftet / 1999 / Engelsk
Brandstädt, Andreas Le Van Bang Spinrad Jeremy P.
Heftet / 1999 / Engelsk
Nettpris:
1.771,-
Levering 7-20 dager
Sjekk lagerstatus i butikk

'Offers a wide and up-to-date panorama on classes of graphs and the corresponding algorithms.' Frederic Maffray, CNRS, Grenoble, France 'An excellent survey of a vast ocean of results ... A must-have for researchers in the field.' Uri N. Peled, University of Illinois at Chicago

This well-organized reference is a definitive encyclopedia for the literature on graph classes. It contains a survey of more than 200 classes of graphs, organized by types of properties used to define and characterize the classes, citing key theorems and literature references for each. The authors state results without proof, providing readers with easy access to far more key theorems than are commonly found in other mathematical texts. Interconnections between graph classes are also provided to make the book useful to a variety of readers.
Les mer
This well-organised reference is a definitive encyclopaedia for the literature on graph classes. It contains a survey of more than 200 classes of graphs, organized by types of properties used to define and characterize the classes, citing key theorems and literature references for each.
Les mer
  • Preface
  • Chapter 1: Basic Concepts
  • Chapter 2: Perfection, Generalized Perfection, and Related Concepts
  • Chapter 3: Cycles, Chords and Bridges
  • Chapter 4: Models and Interactions
  • Chapter 5: Vertex and Edge Orderings
  • Chapter 6: Posets
  • Chapter 7: Forbidden Subgraphs
  • Chapter 8: Hypergraphs and Graphs
  • Chapter 9: Matrices and Polyhedra
  • Chapter 10: Distance Properties
  • Chapter 11: Algebraic Compositions and Recursive Definitions
  • Chapter 12: Decompositions and Cutsets
  • Chapter 13: Threshold Graphs and Related Concepts
  • Chapter 14: The Strong Perfect Graph Conjecture
  • Appendix A: Recognition
  • Appendix B: Containment Relationships
  • Bibliography
  • Index
    Les mer

    Relaterte produkter

    'Offers a wide and up-to-date panorama on classes of graphs and the corresponding algorithms.' Frederic Maffray, CNRS, Grenoble, France 'An excellent survey of a vast ocean of results ... A must-have for researchers in the field.' Uri N. Peled, University of Illinois at Chicago

    This well-organized reference is a definitive encyclopedia for the literature on graph classes. It contains a survey of more than 200 classes of graphs, organized by types of properties used to define and characterize the classes, citing key theorems and literature references for each. The authors state results without proof, providing readers with easy access to far more key theorems than are commonly found in other mathematical texts. Interconnections between graph classes are also provided to make the book useful to a variety of readers.
    Les mer
    This well-organised reference is a definitive encyclopaedia for the literature on graph classes. It contains a survey of more than 200 classes of graphs, organized by types of properties used to define and characterize the classes, citing key theorems and literature references for each.
    Les mer
    • Preface
    • Chapter 1: Basic Concepts
    • Chapter 2: Perfection, Generalized Perfection, and Related Concepts
    • Chapter 3: Cycles, Chords and Bridges
    • Chapter 4: Models and Interactions
    • Chapter 5: Vertex and Edge Orderings
    • Chapter 6: Posets
    • Chapter 7: Forbidden Subgraphs
    • Chapter 8: Hypergraphs and Graphs
    • Chapter 9: Matrices and Polyhedra
    • Chapter 10: Distance Properties
    • Chapter 11: Algebraic Compositions and Recursive Definitions
    • Chapter 12: Decompositions and Cutsets
    • Chapter 13: Threshold Graphs and Related Concepts
    • Chapter 14: The Strong Perfect Graph Conjecture
    • Appendix A: Recognition
    • Appendix B: Containment Relationships
    • Bibliography
    • Index
      Les mer

      Produktdetaljer

      ISBN
      9780898714326
      Publisert
      1999-06-30
      Utgiver
      Society for Industrial & Applied Mathematics,U.S.; Society for Industrial & Applied Mathematics,U.S.
      Vekt
      580 gr
      Høyde
      228 mm
      Bredde
      151 mm
      Dybde
      13 mm
      Aldersnivå
      P, 06
      Språk
      Product language
      Engelsk
      Format
      Product format
      Heftet
      Antall sider
      315

      Forfatter
      Brandstädt, Andreas
      Le Van Bang
      Spinrad Jeremy P.

      Relaterte produkter