Druck auf Anfrage Neuware - Printed after ordering - 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, andplanarity, 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.

N� de ref. del art�culo 9783319196794

Contactar al vendedor

Denunciar este art�culo

Detalles bibliogr�ficos

T�tulo: Genetic Theory for Cubic Graphs
Editor: Springer
Fecha de publicaci�n: 2015
Idioma: Ingl�s
ISBN 10: 3319196790
ISBN 13: 9783319196794
Encuadernaci�n: Taschenbuch
Estado: Neu
Dimensiones: 235�mil�metros de ancho por 155 de alto por 7 de largo
Peso: 230 gramos

Acerca de

Sinopsis

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, andplanarity, 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.

Acerca del autor

Pouya Baniasadi is a doctoral student in mathematics at Flinders University, Australia. He is a recipient of the AF Pillow Applied Mathematics Scholarship from the AF Pillow Mathematics Trust, Australia.

Vladimir Ejov is the leader of the Mathematical Analysis research group within Flinders Mathematical Sciences Laboratory, Flinders University, Australia. His research interests are in the areas of several complex variables, geometry of Cauchy-Riemann manifolds, combinatorial optimisation, Markov decision processes and graph theory.

Jerzy A Filar is Director of Flinders Mathematical Sciences Laboratory, Flinders University, Australia, and is a Fellow of the Australian Mathematical Society. His research interests span both theoretical and applied topics in the fields of operations research, optimization, game theory, applied probability, and environmental modelling.

Michael Haythorpe is mathematician at Flinders University, Australia. His areas of research interest are numerical optimisation, computational mathematics, algorithm development and graph theory. He is a recipient of the AustMS Lift-off Fellowship Award 2010.

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

Descripci�n de la librer�a

Das Unternehmen AHA-BUCH GmbH: Seit der Gr�ndung von AHA-BUCH im Juli 2005 ist unser Hauptziel, zufriedenen Kunden so schnell und so preisg�nstig wie m�glich ihren B�cherwunsch zu erf�llen. Unsere Firma besch�ftigt 16 Mitarbeiter, die nur ein Ziel kennen: den Kunden und seine W�nsche! Auf �ber 3700 m2 Fl�che haben wir �ber 100.000 B�cher, Modernes Antiquariat und Spiele auf Lager.

Ver la p�gina web de la librer�a

Informaci�n empresarial del vendedor

AHA-BUCH GmbH
Garlebsen 48, Einbeck, 37574, Germany

Condiciones de venta y env�o

Condiciones de venta

T�rminos y Condiciones Generales e Informaci�n del Cliente / Pol�tica de Privacidad

I. T�rminos y Condiciones Generales

� 1 Disposiciones b�sicas

(1)Los siguientes t�rminos y condiciones se aplican a todos los contratos que celebre con nosotros como proveedor (AHA-BUCH GmbH) a trav�s de las plataformas de Internet AbeBooks y/o ZVAB. A menos que se acuerde lo contrario, se objetar� la inclusi�n de cualquiera de sus propios t�rminos y condiciones utilizados por usted.
(2)Un consumidor en el sentid...

M�s informaci�n

Derecho al desistimiento

Si es un consumidor, puede rescindir el contrato de acuerdo con lo siguiente. Por consumidor se entiende cualquier persona f�sica que act�e con fines ajenos a su actividad comercial, empresarial, oficio o profesi�n.

Informaci�n sobre el derecho de desistimiento

Derecho legal de desistimiento

Tiene derecho a rescindir este contrato en un plazo de 14 d�as sin dar ning�n motivo.

El periodo de desistimiento vencer� a los 14 d�as desde que usted, o un tercero que no sea el transportista e indicado por usted, adquiera la posesi�n f�sica del �ltimo bien o del �ltimo lote o pieza.

Para ejercer el derecho de desistimiento, complete de forma electr�nica y env�e una declaraci�n clara en nuestro sitio web, desde "Mis compras" en "Mi cuenta". Le enviaremos sin demora un acuse de recibo de dicho desistimiento a trav�s de un soporte duradero (por ejemplo, por correo electr�nico).

Para cumplir con el plazo de desistimiento, basta con que env�e su comunicaci�n relativa al ejercicio del derecho de desistimiento antes de que venza el periodo de desistimiento.

Efectos del desistimiento

Si rescinde este contrato, le reembolsaremos todos los pagos que hayamos recibido de usted, incluidos los gastos de env�o (excepto los gastos adicionales que surjan si elige un tipo de env�o que no sea el tipo de env�o est�ndar m�s econ�mico que ofrecemos).

Podemos hacer una deducci�n del reembolso por la p�rdida de valor de cualquier bien suministrado, si la p�rdida es el resultado de una manipulaci�n innecesaria por su parte.

Efectuaremos el reembolso sin demoras indebidas y, a m�s tardar, 14 d�as despu�s de que se nos informe de su decisi�n de rescindir este contrato.

Efectuaremos el reembolso utilizando el mismo medio de pago que utiliz� para la transacci�n inicial, a menos que haya acordado expresamente lo contrario; en cualquier caso, no incurrir� en ning�n cargo como resultado de dicho reembolso.

Podremos retener el reembolso hasta que hayamos recibido los bienes o hasta que nos haya presentado una prueba de que los ha devuelto, lo que ocurra primero.

Deber� devolver los bienes o entregarlos a AHA-BUCH GmbH, Einbeck, Germany, sin demoras indebidas y, en cualquier caso, en un plazo m�ximo de 14 d�as a partir del d�a en que nos comunique su desistimiento del presente contrato. El plazo se cumple si devuelve la mercanc�a antes de que venza el periodo de 14 d�as. Tendr� que asumir los gastos directos de devoluci�n de los bienes. Usted solo es responsable de la disminuci�n del valor de los bienes como resultado de una manipulaci�n distinta a la necesaria para establecer la naturaleza, las caracter�sticas y el funcionamiento de los bienes.

Excepciones al derecho de desistimiento

El derecho de desistimiento no se aplica a lo siguiente:

La entrega de peri�dicos, diarios o revistas, con la excepci�n de los contratos de suscripci�n; y
El suministro de contenido digital que no se proporcione en un soporte tangible (por ejemplo, en un CD o DVD) si, al hacer el pedido, acept� que pod�amos empezar a entregarlo y que no podr�a desistir una vez iniciada la entrega.

Condiciones de env�o

Enviamos su pedido despu�s de recibirlos
para art�culos disponibles las �ltimas 24 horas,
para art�culos con suministro nocturno a m�s tardar 48 horas.
En caso de que necesitemos pedir un art�culo a nuestro proveedor, nuestro tiempo de env�o depende de la fecha de recepci�n de los art�culos, pero los art�culos se enviar�n el mismo d�a.

Nuestro objetivo es enviar los art�culos pedidos de la manera m�s r�pida, pero tambi�n m�s eficiente y segura a nuestros clientes.

Tarifas de env�o de Alemania a Estados Unidos de America

Tarifas de env�o de Alemania a Estados Unidos de America
Cantidad del pedido	De 7 a 10 d�as h�biles	De 5 a 7 d�as h�biles
Primer art�culo	EUR 35.00	EUR 45.00

Los plazos de entrega los establecen los vendedores y var�an seg�n el transportista y la ubicaci�n. Los pedidos que pasan por la aduana pueden sufrir retrasos y los compradores son responsables de los aranceles o tarifas asociadas. Los vendedores pueden ponerse en contacto con usted en relaci�n con cargos adicionales para cubrir cualquier aumento en los costes de env�o de los art�culos.

Informaci�n detallada sobre el vendedor