Omschrijving
This book was motivated by the notion that some of the underlying difficulty in challenging instances of graph-based problems (e.g., the Traveling Salesman Problem) may be “inherited” from simpler graphs which – in an appropriate sense – could be seen as “ancestors” of the given graph instance. The authors propose a partitioning of the set of unlabeled, connected cubic graphs into two disjoint subsets named genes and descendants, where the cardinality of the descendants dominates that of the genes. The key distinction between the two subsets is the presence of special edge cut sets, called cubic crackers, in the descendants. The book begins by proving that any given descendant may be constructed by starting from a finite set of genes and introducing the required cubic crackers through the
Kenmerken
| Artikelnummer | 9200000046655381 |
|---|---|
| EAN | 9783319196800 |
| Categorie | Digital Reading |
| Productgroep | Boeken |
| Segment | Textual/Printed/Reference Materials |
| Prijs Nederland | € 53,99 |
| Prijs België | € 53,99 |
| Verzendkosten NL | Gratis |
| Verzendkosten BE | Gratis |
| Levertijd Nederland | Morgen in huis |
| Levertijd België | Morgen in huis |
| Verkoper | Partner |
SpringerBriefs in Operations Research 0 - Genetic Theory for Cubic Graphs bestellen bij snelkeus
Koop SpringerBriefs in Operations Research 0 - Genetic Theory for Cubic Graphs van Onbekend online in de categorie Digital Reading. Prijs € 53,99, levering in Nederland · Morgen in huis.