國立虎尾科技大學 |

Genetic Theory for Cubic Graphs

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Genetic Theory for Cubic Graphs/ by Pouya Baniasadi, Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe.
作者:	Baniasadi, Pouya.
其他作者:	Ejov, Vladimir.
面頁冊數:	X, 118 p. 85 illus., 8 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Operations research. -
電子資源:	https://doi.org/10.1007/978-3-319-19680-0
ISBN:	9783319196800

Genetic Theory for Cubic Graphs
Baniasadi, Pouya.

Genetic Theory for Cubic Graphs[electronic resource] /by Pouya Baniasadi, Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe. - 1st ed. 2016. - X, 118 p. 85 illus., 8 illus. in color.online resource. - SpringerBriefs in Operations Research,02195-0482 ;. - SpringerBriefs in Operations Research,.

Genetic Theory for Cubic Graphs -- Inherited Properties of Descendants -- Uniqueness of Ancestor Genes -- Completed Proofs from Chapter 3.

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 use of six special operations, called breeding operations. It shows that each breeding operation is invertible, and these inverse operations are examined. It is therefore possible, for any given descendant, to identify a family of genes that could be used to generate the descendant. The authors refer to such a family of genes as a “complete family of ancestor genes” for that particular descendant. The book proves the fundamental, although quite unexpected, result that any given descendant has exactly one complete family of ancestor genes. This result indicates that the particular combination of breeding operations used strikes the right balance between ensuring that every descendant may be constructed while permitting only one generating set. The result that any descendant can be constructed from a unique set of ancestor genes indicates that most of the structure in the descendant has been, in some way, inherited from that, very special, complete family of ancestor genes, with the remaining structure induced by the breeding operations. After establishing this, the authors proceed to investigate a number of graph theoretic properties: Hamiltonicity, bipartiteness, and planarity, and prove results linking properties of the descendant to those of the ancestor genes. They develop necessary (and in some cases, sufficient) conditions for a descendant to contain a property in terms of the properties of its ancestor genes. These results motivate the development of parallelizable heuristics that first decompose a graph into ancestor genes, and then consider the genes individually. In particular, they provide such a heuristic for the Hamiltonian cycle problem. Additionally, a framework for constructing graphs with desired properties is developed, which shows how many (known) graphs that constitute counterexamples of conjectures could be easily found.

ISBN: 9783319196800

Standard No.: 10.1007/978-3-319-19680-0doiSubjects--Topical Terms:

573517
Operations research.

LC Class. No.: HD30.23

Dewey Class. No.: 658.40301

Genetic Theory for Cubic Graphs
LDR:04260nam a22004095i 4500 001 979332
003 DE-He213
005 20200703164325.0
007 cr nn 008mamaa
008 201211s2016 gw | s |||| 0|eng d
020 $a 9783319196800 $9 978-3-319-19680-0
024 7 $a 10.1007/978-3-319-19680-0 $2 doi
035 $a 978-3-319-19680-0
050 4 $a HD30.23
072 7 $a KJT $2 bicssc
072 7 $a BUS049000 $2 bisacsh
072 7 $a KJT $2 thema
072 7 $a KJMD $2 thema
082 0 4 $a 658.40301 $2 23
100 1 $a Baniasadi, Pouya. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1101587
245 1 0 $a Genetic Theory for Cubic Graphs $h [electronic resource] / $c by Pouya Baniasadi, Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe.
250 $a 1st ed. 2016.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a X, 118 p. 85 illus., 8 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a SpringerBriefs in Operations Research, $x 2195-0482 ; $v 0
505 0 $a Genetic Theory for Cubic Graphs -- Inherited Properties of Descendants -- Uniqueness of Ancestor Genes -- Completed Proofs from Chapter 3.
520 $a 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 use of six special operations, called breeding operations. It shows that each breeding operation is invertible, and these inverse operations are examined. It is therefore possible, for any given descendant, to identify a family of genes that could be used to generate the descendant. The authors refer to such a family of genes as a “complete family of ancestor genes” for that particular descendant. The book proves the fundamental, although quite unexpected, result that any given descendant has exactly one complete family of ancestor genes. This result indicates that the particular combination of breeding operations used strikes the right balance between ensuring that every descendant may be constructed while permitting only one generating set. The result that any descendant can be constructed from a unique set of ancestor genes indicates that most of the structure in the descendant has been, in some way, inherited from that, very special, complete family of ancestor genes, with the remaining structure induced by the breeding operations. After establishing this, the authors proceed to investigate a number of graph theoretic properties: Hamiltonicity, bipartiteness, and planarity, and prove results linking properties of the descendant to those of the ancestor genes. They develop necessary (and in some cases, sufficient) conditions for a descendant to contain a property in terms of the properties of its ancestor genes. These results motivate the development of parallelizable heuristics that first decompose a graph into ancestor genes, and then consider the genes individually. In particular, they provide such a heuristic for the Hamiltonian cycle problem. Additionally, a framework for constructing graphs with desired properties is developed, which shows how many (known) graphs that constitute counterexamples of conjectures could be easily found.
650 0 $a Operations research. $3 573517
650 0 $a Decision making. $3 528319
650 0 $a Management science. $3 719678
650 0 $a Graph theory. $3 527884
650 1 4 $a Operations Research/Decision Theory. $3 669176
650 2 4 $a Operations Research, Management Science. $3 785065
650 2 4 $a Graph Theory. $3 786670
700 1 $a Ejov, Vladimir. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1272446
700 1 $a Filar, Jerzy A. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1272447
700 1 $a Haythorpe, Michael. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1272448
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319196794
776 0 8 $i Printed edition: $z 9783319196817
830 0 $a SpringerBriefs in Operations Research, $x 2195-0482 $3 1261523
856 4 0 $u https://doi.org/10.1007/978-3-319-19680-0
912 $a ZDB-2-BUM
912 $a ZDB-2-SXBM
950 $a Business and Management (SpringerNature-41169)
950 $a Business and Management (R0) (SpringerNature-43719)