. .
Deutsch
Deutschland
Ähnliche Bücher
Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Suchtools
Anmelden

Anmelden mit Facebook:

Registrieren
Passwort vergessen?


Such-Historie
Merkliste
Links zu eurobuch.com

Dieses Buch teilen auf…
..?
Buchtipps
Aktuelles
Tipp von eurobuch.com
FILTER
- 0 Ergebnisse
Kleinster Preis: 17.99 EUR, größter Preis: 78.81 EUR, Mittelwert: 32.06 EUR
Graph families: Planar graph, Regular graph, Expander graph, Extractor, Disperser, Median graph, Apollonian network, Pseudoforest - Source: Wikipedia
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)
Source: Wikipedia:

Graph families: Planar graph, Regular graph, Expander graph, Extractor, Disperser, Median graph, Apollonian network, Pseudoforest - neues Buch

ISBN: 9781156127193

Source: Wikipedia, Paperback, English-language edition, Pub by General Books LLC Books Graph-families~~Source-Source-Wikipedia General Books LLC Source: Wikipedia. Pages: 84. Chapters: Planar graph, Regular graph, Expander graph, Extractor, Disperser, Median graph, Apollonian network, Pseudoforest, Claw-free graph, Scale-free network, Hypohamiltonian graph, Apex graph, Small-world network, Distance-hereditary graph, Line graph, Outerplanar graph, Skew-symmetric graph, Cayley graph, Triangle-free graph, Forbidden graph characterization, Split graph, Chordal graph, Cubic graph, Comparability graph, Gallery of named graphs, Snark, Biased graph, Cograph, Line graph of a hypergraph, Moore graph, Series-parallel graph, Partial cube, Trivially perfect graph, Bipartite graph, Cactus graph, Block graph, Distance-transitive graph, Strongly chordal graph, Simplex graph, Distance-regular graph, Universal graph, Strongly regular graph, Halin graph, Threshold graph, Toroidal graph, Cage, Generalized scale-free model, Aperiodic graph, Squaregraph, Vertex-transitive graph, Ramanujan graph, Dense graph, Asymmetric graph, K-Variegated graph, Quasi-bipartite graph, Even-hole-free graph, Critical graph, K-tree, Semi-symmetric graph, List of graphs, Convex bipartite graph, Laman graph, K-vertex-connected graph, Biconnected graph, Self-complementary graph, K-edge-connected graph, Half-transitive graph, Lévy family of graphs, Edge-transitive graph, Lattice graph, Implication graph, Overfull graph, Bound graph, Reeb graph, Conference graph, Integral graph, Hanan grid, Factor-critical graph, Quartic graph, Trellis. Excerpt: In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest paths between any two of a, b, and c. The concept of median graphs has long been studied, for instance by Birkhoff & Kiss (1947) or (more explicitly) by Avann (1961), but the first paper to call them "median graphs" appears to be Nebesk'y (1971). As Chung, Graham, and Saks write, "median graphs arise naturally in the study of ordered sets and discrete distributive lattices, and have an extensive literature". In phylogenetics, the Buneman graph representing all maximum parsimony evolutionary trees is a median graph. Median graphs also arise in social choice theory: if a set of alternatives has the structure of a median graph, it is possible to derive in an unambiguous way a majority preference among them. Additional surveys of median graphs are given by Klavzar & Mulder (1999), Bandelt & Chepoi (2008), and Knuth (2008). The median of three vertices in a tree, showing the subtree formed by the union of shortest paths between the vertices.Any tree is a median graph. To see this, observe that in a tree, the union of the three shortest paths between any three vertices a, b, and c is either itself a path, or a subtree formed by three paths meeting at a single central node with degree three. If the union of the three paths is itself a path, the median m(a,b,c) is equal to one of a, b, or c, whichever of these three vertices is between the other two in the path. If the subtree formed by the union of the three paths is not a path, the median of the three vertices is the central degree-three node of the subtree. Additional examples of median graphs are provided by the grid graphs. In a grid graph, the coordinates of the median m(a,b,c) can be found as the median of the coordinates of a, b, and c. Conversely, it turns out that, in any median graph, one may label the vertices by points

Neues Buch [USA] Barnesandnoble.com
Free Shipping on eligible orders over $25 Versandkosten:zzgl. Versandkosten
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
Graph Families: Planar Graph, Regular Graph, Expander Graph, Extractor, Disperser, Median Graph, Pseudoforest, Claw-Free Graph
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)
Graph Families: Planar Graph, Regular Graph, Expander Graph, Extractor, Disperser, Median Graph, Pseudoforest, Claw-Free Graph - neues Buch

2010, ISBN: 115612719X, Lieferbar binnen 4-6 Wochen Versandkosten:Versandkostenfrei innerhalb der BRD

ID: 9781156127193

Internationaler Buchtitel. In englischer Sprache. Verlag: LIFE JOURNEY, 742 Seiten, L=152mm, B=229mm, H=41mm, Gew.=1070gr, Kartoniert/Broschiert Source: Wikipedia. Pages: 84. Chapters: Planar graph, Regular graph, Expander graph, Extractor, Disperser, Median graph, Apollonian network, Pseudoforest, Claw-free graph, Scale-free network, Hypohamiltonian graph, Apex graph, Small-world network, Distance-hereditary graph, Line graph, Outerplanar graph, Skew-symmetric graph, Cayley graph, Triangle-free graph, Forbidden graph characterization, Split graph, Chordal graph, Cubic graph, Comparability graph, Gallery of named graphs, Snark, Biased graph, Cograph, Line graph of a hypergraph, Moore graph, Series-parallel graph, Partial cube, Trivially perfect graph, Bipartite graph, Cactus graph, Block graph, Distance-transitive graph, Strongly chordal graph, Simplex graph, Distance-regular graph, Universal graph, Strongly regular graph, Halin graph, Threshold graph, Toroidal graph, Cage, Generalized scale-free model, Aperiodic graph, Squaregraph, Vertex-transitive graph, Ramanujan graph, Dense graph, Asymmetric graph, K-Variegated graph, Quasi-bipartite graph, Even-hole-free graph, Critical graph, K-tree, Semi-symmetric graph, List of graphs, Convex bipartite graph, Laman graph, K-vertex-connected graph, Biconnected graph, Self-complementary graph, K-edge-connected graph, Half-transitive graph, Lévy family of graphs, Edge-transitive graph, Lattice graph, Implication graph, Overfull graph, Bound graph, Reeb graph, Conference graph, Integral graph, Hanan grid, Factor-critical graph, Quartic graph, Trellis. Excerpt: In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest paths between any two of a, b, and c. The concept of median graphs has long been studied, for instance by Birkhoff & Kiss (1947) or (more explicitly) by Avann (1961), but the first paper to call them "median graphs" appears to be Nebesk'y (1971). As Chung, Graham, and Saks write, "median graphs arise naturally in the study of ordered sets and discrete distributive lattices, and have an extensive literature". In phylogenetics, the Buneman graph representing all maximum parsimony evolutionary trees is a median graph. Median graphs also arise in social choice theory: if a set of alternatives has the structure of a median graph, it is possible to derive in an unambiguous way a majority preference among them. Additional surveys of median graphs are given by Klavzar & Mulder (1999), Bandelt & Chepoi (2008), and Knuth (2008). The median of three vertices in a tree, showing the subtree formed by the union of shortest paths between the vertices.Any tree is a median graph. To see this, observe that in a tree, the union of the three shortest paths between any three vertices a, b, and c is either itself a path, or a subtree formed by three paths meeting at a single central node with degree three. If the union of the three paths is itself a path, the median m(a,b,c) is equal to one of a, b, or c, whichever of these three vertices is between the other two in the path. If the subtree formed by the union of the three paths is not a path, the median of the three vertices is the central degree-three node of the subtree. Additional examples of median graphs are provided by the grid graphs. In a grid graph, the coordinates of the median m(a,b,c) can be found as the median of the coordinates of a, b, and c. Conversely, it turns out that, in any median graph, one may label the vertices by points

Neues Buch DEU
Buchgeier.com
Lieferbar binnen 4-6 Wochen (Besorgungstitel) Versandkosten:Versandkostenfrei innerhalb der BRD
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
Graph families - Source
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)
Source:
Graph families - Taschenbuch

2011

ISBN: 115612719X

ID: 9395649361

[EAN: 9781156127193], Neubuch, [PU: Jun 2011], COMPUTERS / COMPUTER SCIENCE, This item is printed on demand - Print on Demand Titel. - Source: Wikipedia. Pages: 84. Chapters: Planar graph, Regular graph, Expander graph, Extractor, Disperser, Median graph, Apollonian network, Pseudoforest, Claw-free graph, Scale-free network, Hypohamiltonian graph, Apex graph, Small-world network, Distance-hereditary graph, Line graph, Outerplanar graph, Skew-symmetric graph, Cayley graph, Triangle-free graph, Forbidden graph characterization, Split graph, Chordal graph, Cubic graph, Comparability graph, Gallery of named graphs, Snark, Biased graph, Cograph, Line graph of a hypergraph, Moore graph, Series-parallel graph, Partial cube, Trivially perfect graph, Bipartite graph, Cactus graph, Block graph, Distance-transitive graph, Strongly chordal graph, Simplex graph, Distance-regular graph, Universal graph, Strongly regular graph, Halin graph, Threshold graph, Toroidal graph, Cage, Generalized scale-free model, Aperiodic graph, Squaregraph, Vertex-transitive graph, Ramanujan graph, Dense graph, Asymmetric graph, K-Variegated graph, Quasi-bipartite graph, Even-hole-free graph, Critical graph, K-tree, Semi-symmetric graph, List of graphs, Convex bipartite graph, Laman graph, K-vertex-connected graph, Biconnected graph, Self-complementary graph, K-edge-connected graph, Half-transitive graph, Lévy family of graphs, Edge-transitive graph, Lattice graph, Implication graph, Overfull graph, Bound graph, Reeb graph, Conference graph, Integral graph, Hanan grid, Factor-critical graph, Quartic graph, Trellis. Excerpt: In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest paths between any two of a, b, and c. The concept of median graphs has long been studied, for instance by Birkhoff & Kiss (1947) or (more explicitly) by Avann (1961), but the first paper to call them 'median graphs' appears to be Nebesk'y (1971). As Chung, Graham, and Saks write, 'median graphs arise naturally in the study of ordered sets and discrete distributive lattices, and have an extensive literature'. In phylogenetics, the Buneman graph representing all maximum parsimony evolutionary trees is a median graph. Median graphs also arise in social choice theory: if a set of alternatives has the structure of a median graph, it is possible to derive in an unambiguous way a majority preference among them. Additional surveys of median graphs are given by Klavzar & Mulder (1999), Bandelt & Chepoi (2008), and Knuth (2008). The median of three vertices in a tree, showing the subtree formed by the union of shortest paths between the vertices.Any tree is a median graph. To see this, observe that in a tree, the union of the three shortest paths between any three vertices a, b, and c is either itself a path, or a subtree formed by three paths meeting at a single central node with degree three. If the union of the three paths is itself a path, the median m(a,b,c) is equal to one of a, b, or c, whichever of these three vertices is between the other two in the path. If the subtree formed by the union of the three paths is not a path, the median of the three vertices is the central degree-three node of the subtree. Additional examples of median graphs are provided by the grid graphs. In a grid graph, the coordinates of the median m(a,b,c) can be found as the median of the coordinates of a, b, and c. Conversely, it turns out that, in any median graph, one may label the vertices by points 84 pp. Englisch

Neues Buch Abebooks.de
AHA-BUCH GmbH, Kreiensen, NDS, Germany [51283250] [Rating: 5 (von 5)]
NEW BOOK Versandkosten:Versandkostenfrei (EUR 0.00)
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
Graph families: Planar graph, Regular graph, Expander graph, Extractor, Disperser, Median graph, Apollonian network, Pseudoforest - Source: Wikipedia
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)
Source: Wikipedia:
Graph families: Planar graph, Regular graph, Expander graph, Extractor, Disperser, Median graph, Apollonian network, Pseudoforest - neues Buch

ISBN: 9781156127193

ID: 9781156127193

Source: Wikipedia, Paperback, English-language edition, Pub by General Books LLC Books, , Graph-families~~Source-Source-Wikipedia, 999999999, Graph families: Planar graph, Regular graph, Expander graph, Extractor, Disperser, Median graph, Apollonian network, Pseudofores, Source: Wikipedia, 115612719X, General Books LLC, , , , , General Books LLC

Neues Buch Barnesandnoble.com
MPN: , SKU 9781156127193 Versandkosten:zzgl. Versandkosten
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
Graph families: Planar graph, Regular graph, Expander graph, Extractor, Disperser, Median graph, Apollonian network, Pseudoforest - Source: Wikipedia
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)
Source: Wikipedia:
Graph families: Planar graph, Regular graph, Expander graph, Extractor, Disperser, Median graph, Apollonian network, Pseudoforest - Taschenbuch

2016, ISBN: 115612719X

ID: 19982794120

[EAN: 9781156127193], Neubuch, [PU: Books LLC, Wiki Series], GRAPH FAMILIES: PLANAR GRAPH, REGULAR EXPANDER EXTRACTOR, DISPERSER, MEDIAN APOLLONIAN NETWORK, PSEUDOFOREST, PRINT ON DEMAND Book; New; Publication Year 2016; Not Signed; Fast Shipping from the UK.

Neues Buch Abebooks.de
Ria Christie Collections, Uxbridge, United Kingdom [59718070] [Rating: 5 (von 5)]
NEW BOOK Versandkosten: EUR 3.77
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.

< zum Suchergebnis...
Details zum Buch
Graph Families: Planar Graph, Regular Graph, Expander Graph, Extractor, Disperser, Median Graph, Pseudoforest, Claw-Free Graph
Autor:

Source

Titel:

Graph Families: Planar Graph, Regular Graph, Expander Graph, Extractor, Disperser, Median Graph, Pseudoforest, Claw-Free Graph

ISBN-Nummer:

115612719X

Source: Wikipedia. Pages: 84. Chapters: Planar graph, Regular graph, Expander graph, Extractor, Disperser, Median graph, Apollonian network, Pseudoforest, Claw-free graph, Scale-free network, Hypohamiltonian graph, Apex graph, Small-world network, Distance-hereditary graph, Line graph, Outerplanar graph, Skew-symmetric graph, Cayley graph, Triangle-free graph, Forbidden graph characterization, Split graph, Chordal graph, Cubic graph, Comparability graph, Gallery of named graphs, Snark, Biased graph, Cograph, Line graph of a hypergraph, Moore graph, Series-parallel graph, Partial cube, Trivially perfect graph, Bipartite graph, Cactus graph, Block graph, Distance-transitive graph, Strongly chordal graph, Simplex graph, Distance-regular graph, Universal graph, Strongly regular graph, Halin graph, Threshold graph, Toroidal graph, Cage, Generalized scale-free model, Aperiodic graph, Squaregraph, Vertex-transitive graph, Ramanujan graph, Dense graph, Asymmetric graph, K-Variegated graph, Quasi-bipartite graph, Even-hole-free graph, Critical graph, K-tree, Semi-symmetric graph, List of graphs, Convex bipartite graph, Laman graph, K-vertex-connected graph, Biconnected graph, Self-complementary graph, K-edge-connected graph, Half-transitive graph, Lévy family of graphs, Edge-transitive graph, Lattice graph, Implication graph, Overfull graph, Bound graph, Reeb graph, Conference graph, Integral graph, Hanan grid, Factor-critical graph, Quartic graph, Trellis. Excerpt: In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest paths between any two of a, b, and c. The concept of median graphs has long been studied, for instance by Birkhoff & Kiss (1947) or (more explicitly) by Avann (1961), but the first paper to call them "median graphs" appears to be Nebesk'y (1971). As Chung, Graham, and Saks write, "median graphs arise naturally in the study of ordered sets and discrete distributive lattices, and have an extensive literature". In phylogenetics, the Buneman graph representing all maximum parsimony evolutionary trees is a median graph. Median graphs also arise in social choice theory: if a set of alternatives has the structure of a median graph, it is possible to derive in an unambiguous way a majority preference among them. Additional surveys of median graphs are given by Klavzar & Mulder (1999), Bandelt & Chepoi (2008), and Knuth (2008). The median of three vertices in a tree, showing the subtree formed by the union of shortest paths between the vertices.Any tree is a median graph. To see this, observe that in a tree, the union of the three shortest paths between any three vertices a, b, and c is either itself a path, or a subtree formed by three paths meeting at a single central node with degree three. If the union of the three paths is itself a path, the median m(a,b,c) is equal to one of a, b, or c, whichever of these three vertices is between the other two in the path. If the subtree formed by the union of the three paths is not a path, the median of the three vertices is the central degree-three node of the subtree. Additional examples of median graphs are provided by the grid graphs. In a grid graph, the coordinates of the median m(a,b,c) can be found as the median of the coordinates of a, b, and c. Conversely, it turns out that, in any median graph, one may label the vertices by points

Detailangaben zum Buch - Graph Families: Planar Graph, Regular Graph, Expander Graph, Extractor, Disperser, Median Graph, Pseudoforest, Claw-Free Graph


EAN (ISBN-13): 9781156127193
ISBN (ISBN-10): 115612719X
Taschenbuch
Erscheinungsjahr: 2010
Herausgeber: LIFE JOURNEY
742 Seiten
Gewicht: 1,070 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 12.02.2012 07:32:31
Buch zuletzt gefunden am 16.08.2016 00:22:15
ISBN/EAN: 115612719X

ISBN - alternative Schreibweisen:
1-156-12719-X, 978-1-156-12719-3

< zum Suchergebnis...
< zum Archiv...
Benachbarte Bücher