- 4 Ergebnisse
Kleinster Preis: € 71,39, größter Preis: € 71,39, Mittelwert: € 71,39
1
Graph-Theoretic Concepts in Computer Science - Ernst W. Mayr; Gunther Schmidt; Gottfried Tinhofer
Bestellen
bei Springer.com
€ 71,39
Bestellen
Details und Versand
gesponserter Link
Ernst W. Mayr; Gunther Schmidt; Gottfried Tinhofer:

Graph-Theoretic Concepts in Computer Science - neues Buch

ISBN: 9783540491835

This volume presents the proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '94), held in Herrsching, Germany in June 1994. The volume cont… Mehr…

  - new in stock. Versandkosten:zzgl. Versandkosten.
zuklappen (X)
2
Graph-Theoretic Concepts in Computer Science - Ernst W. Mayr; Gunther Schmidt; Gottfried Tinhofer
Bestellen
bei Springer.com
€ 71,39
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link

Ernst W. Mayr; Gunther Schmidt; Gottfried Tinhofer:

Graph-Theoretic Concepts in Computer Science - neues Buch

ISBN: 9783540491835

Computer Science; Theory of Computation; Discrete Mathematics; Algorithm Analysis and Problem Complexity; Combinatorics; Logics and Meanings of Programs Combinatorial ALgorithms, Graph, G… Mehr…

  - Versandkosten: EUR 0.00
zuklappen (X)
3
Graph-Theoretic Concepts in Computer Science - Ernst W. Mayr; Gunther Schmidt; Gottfried Tinhofer
Bestellen
bei Springer.com
€ 71,39
Bestellen
Details und Versand
gesponserter Link
Ernst W. Mayr; Gunther Schmidt; Gottfried Tinhofer:
Graph-Theoretic Concepts in Computer Science - neues Buch

ISBN: 9783540491835

Computer Science; Theory of Computation; Discrete Mathematics; Algorithm Analysis and Problem Complexity; Combinatorics; Logics and Meanings of Programs Combinatorial ALgorithms, Graph, G… Mehr…

  - Versandkosten:zzgl. Versandkosten.
zuklappen (X)
4
Graph-Theoretic Concepts in Computer Science - Ernst W. Mayr; Gunther Schmidt; Gottfried Tinhofer
Bestellen
bei Springer.com
€ 71,39
Bestellen
Details und Versand
gesponserter Link
Ernst W. Mayr; Gunther Schmidt; Gottfried Tinhofer:
Graph-Theoretic Concepts in Computer Science - neues Buch

ISBN: 9783540491835

Computer Science; Theory of Computation; Discrete Mathematics; Algorithm Analysis and Problem Complexity; Combinatorics; Logics and Meanings of Programs Combinatorial ALgorithms, Graph, G… Mehr…

  - Versandkosten:zzgl. Versandkosten.
zuklappen (X)
1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.

Bibliographische Daten des bestpassenden Buches

Details zum Buch
Graph-Theoretic Concepts in Computer Science
Autor:
Titel:
ISBN-Nummer:

9783540491835

Detailangaben zum Buch - Graph-Theoretic Concepts in Computer Science


EAN (ISBN-13): 9783540491835
Herausgeber: Springer Science+Business Media

Buch in der Datenbank seit 2016-12-21T12:38:03+01:00 (Zurich)
Detailseite zuletzt geändert am 2021-10-29T11:29:00+02:00 (Zurich)
ISBN/EAN: 9783540491835

ISBN - alternative Schreibweisen:
978-3-540-49183-5
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: schmidt günther, schmidt ernst, gunther schmidt, mayr ernst, gottfried
Titel des Buches: graph theoretic concepts computer science

Daten vom Verlag:

Autor/in: Ernst W. Mayr; Gunther Schmidt; Gottfried Tinhofer
Titel: Lecture Notes in Computer Science; Graph-Theoretic Concepts in Computer Science - 20th International Workshop. WG '94, Herrsching, Germany, June 16 - 18, 1994. Proceedings
Verlag: Springer; Springer Berlin
425 Seiten
Erscheinungsjahr: 2005-06-30
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XI, 425 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Combinatorial ALgorithms; Graph; Graph Algorithms; Graph Gramars; Graph-Algorithmen; Graph-Grammatiken; Graph-Theory; Kombinatorische Algorithmen; Planar Graphs; algorithm; algorithms; computer; computer science; algorithm analysis and problem complexity; combinatorics; C; Theory of Computation; Discrete Mathematics; Algorithms; Computer Science Logic and Foundations of Programming; Computer Science; Diskrete Mathematik; Algorithmen und Datenstrukturen; BC

Domino treewidth.- A lower bound for treewidth and its consequences.- Tree-width and path-width of comparability graphs of interval orders.- A declarative approach to graph based modeling.- Multilevel graph grammars.- The algorithmic use of hypertree structure and maximum neighbourhood orderings.- On domination elimination orderings and domination graphs.- Complexity of graph covering problems.- Dominoes.- GLB-closures in directed acyclic graphs and their applications.- Minimum vertex cover, distributed decision-making, and communication complexity.- Cartesian products of graphs as spanning subgraphs of de Bruijn graphs.- Specification of graph translators with triple graph grammars.- Using programmed graph rewriting for the formal specification of a configuration management system.- Exponential time analysis of confluent and boundary eNCE graph languages.- Time-optimal tree computations on sparse meshes.- Prefix graphs and their applications.- The complexity of broadcasting in planarand decomposable graphs.- The maximal f-dependent set problem for planar graphs is in NC.- On-line convex planarity testing.- Book embeddings and crossing numbers.- Measuring the distance to series-parallelity by path expressions.- Labelled trees and pairs of input-output permutations in priority queues.- Rankings of graphs.- Bypass strong V-structures and find an isomorphic labelled subgraph in linear time.- Efficient algorithms for a mixed k-partition problem of graphs without specifying bases.- Fugitive-search games on graphs and related parameters.- New approximation results on graph matching and related problems.- New lower bounds and hierarchy results for restricted branching programs.- On-line algorithms for satisfiability problems with uncertainty.- NC algorithms for antidirected hamiltonian paths and cycles in tournaments.- Directed path graph isomorphism.
< zum Archiv...