- Retrait en 2 heures
- Assortiment impressionnant
- Paiement sécurisé
- Toujours un magasin près de chez vous
- Retrait gratuit dans votre magasin Club
- 7.000.0000 titres dans notre catalogue
- Payer en toute sécurité
- Toujours un magasin près de chez vous
Description
The domination problem in graph theory is to find a minimum sized vertex subset in a graph such that every vertex not in this set is adjacent to at least one vertex in this set. The domination problem and its variations serve as good models for many real problems including location problems in operations research.
This comprehensive volume introduces domination and its variations in graphs from an algorithmic point of view. It examines the structures of various graph classes, including trees, chordal graphs, strongly chordal graphs, interval graphs, comparability graphs, permutation graphs, distance-hereditary graphs and generalizations of these graphs. These structure properties provide concepts for designing the algorithms.
This useful reference text benefits researchers, academics, and graduate students in theoretical computer science, combinatorics, and operations research.
Spécifications
Parties prenantes
- Auteur(s) :
- Editeur:
Contenu
- Nombre de pages :
- 360
- Langue:
- Anglais
- Collection :
Caractéristiques
- EAN:
- 9789819817283
- Date de parution :
- 03-01-26
- Format:
- Livre relié
- Format numérique:
- Genaaid
- Dimensions :
- 152 mm x 229 mm
- Poids :
- 648 g
Seulement chez Librairie Club
+ 329 points sur votre carte client de Librairie Club
Cadeau
Cadeau
Les avis
Nous publions uniquement les avis qui respectent les conditions requises. Consultez nos conditions pour les avis.