2026, ISBN: 9783540564027
[ED: Taschenbuch], [PU: Springer Berlin Heidelberg], Neuware - The 18th International Workshop on Graph-Theoretic Conceptsin Computer Science (WG '92) was held inWiesbaden-Naurod, Ger… Mehr…
booklooker.de |
Graph-Theoretic Concepts in Computer Science 18th International Workshop, WG '92, Wiesbaden-Naurod, Germany, June 18-20, 1992. Proceedings - neues Buch
1993, ISBN: 3540564020
1993 Kartoniert / Broschiert Algorithmus, Datenverarbeitung / Datenverschlüsselung, Kryptografie, Kombinatorik, Mathematik, Algorithmen und Datenstrukturen, Software Engineering, Theore… Mehr…
Achtung-Buecher.de MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien Versandkosten:Sans frais d'envoi en Allemagne. (EUR 0.00) Details... |
1993, ISBN: 9783540564027
Taschenbuch
[ED: Kartoniert / Broschiert], [PU: Springer Berlin Heidelberg], Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The 18th International Wo… Mehr…
booklooker.de |
1993, ISBN: 9783540564027
Taschenbuch
18th International Workshop, WG '92, Wiesbaden-Naurod, Germany, June 18-20, 1992. Proceedings, Buch, Softcover, 1993, [PU: Springer Berlin], Springer Berlin, 1993
lehmanns.de Versandkosten:Versand in 10-14 Tagen. (EUR 9.95) Details... |
ISBN: 9783540564027
Livre, [PU: Springer, Berlin/Heidelberg]
Rakuten.fr |
2026, ISBN: 9783540564027
[ED: Taschenbuch], [PU: Springer Berlin Heidelberg], Neuware - The 18th International Workshop on Graph-Theoretic Conceptsin Computer Science (WG '92) was held inWiesbaden-Naurod, Ger… Mehr…
Mayr, Ernst W. (Herausgeber):
Graph-Theoretic Concepts in Computer Science 18th International Workshop, WG '92, Wiesbaden-Naurod, Germany, June 18-20, 1992. Proceedings - neues Buch1993, ISBN: 3540564020
1993 Kartoniert / Broschiert Algorithmus, Datenverarbeitung / Datenverschlüsselung, Kryptografie, Kombinatorik, Mathematik, Algorithmen und Datenstrukturen, Software Engineering, Theore… Mehr…
1993
ISBN: 9783540564027
Taschenbuch
[ED: Kartoniert / Broschiert], [PU: Springer Berlin Heidelberg], Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The 18th International Wo… Mehr…
1993, ISBN: 9783540564027
Taschenbuch
18th International Workshop, WG '92, Wiesbaden-Naurod, Germany, June 18-20, 1992. Proceedings, Buch, Softcover, 1993, [PU: Springer Berlin], Springer Berlin, 1993
ISBN: 9783540564027
Livre, [PU: Springer, Berlin/Heidelberg]
Bibliographische Daten des bestpassenden Buches
Autor: | |
Titel: | |
ISBN-Nummer: |
Detailangaben zum Buch - Graph-Theoretic Concepts in Computer Science
EAN (ISBN-13): 9783540564027
ISBN (ISBN-10): 3540564020
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 1993
Herausgeber: Springer Berlin
350 Seiten
Gewicht: 0,550 kg
Buch in der Datenbank seit 2007-05-29T14:33:40+02:00 (Zurich)
Detailseite zuletzt geändert am 2024-03-12T16:57:13+01:00 (Zurich)
ISBN/EAN: 9783540564027
ISBN - alternative Schreibweisen:
3-540-56402-0, 978-3-540-56402-7
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: mayr ernst, may ernst, johann wolfgang goethe, frankfurt
Titel des Buches: graph theoretic concepts computer science, lecture notes computer science, wiesbaden international, proceedings june 1992, proceedings international workshop
Daten vom Verlag:
Autor/in: Ernst W. Mayr
Titel: Lecture Notes in Computer Science; Graph-Theoretic Concepts in Computer Science - 18th International Workshop, WG '92, Wiesbaden-Naurod, Germany, June 18-20, 1992. Proceedings
Verlag: Springer; Springer Berlin
355 Seiten
Erscheinungsjahr: 1993-02-26
Berlin; Heidelberg; DE
Gewicht: 1,140 kg
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
POD
IX, 355 p.
BC; Theory of Computation; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Combinatorial Algorithms; Distributed Algorithms; Graph; Graph-Theeory; Kombinatorische Algorithmen; Programmier-Semantik; Scheduling; Semantics of Programming; algorithm; algorithms; modeling; algorithm analysis and problem complexity; combinatorics; Computer System Implementation; Software Engineering/Programming and Operating Systems; Algorithm Analysis and Problem Complexity; Combinatorics; Computation by Abstract Devices; Theory of Computation; Computer System Implementation; Software Engineering; Algorithms; Discrete Mathematics; Systemanalyse und -design; Software Engineering; Algorithmen und Datenstrukturen; Diskrete Mathematik; EA
On improved time bounds for permutation graph problems.- A simple test for interval graphs.- Tolerance graphs and orders.- On scheduling problems restricted to interval orders.- Scheduling with incompatible jobs.- Generalized coloring for tree-like graphs.- Optimal (parallel) algorithms for the all-to-all vertices distance problem for certain graph classes.- Topology of parallel networks and computational complexity (extended abstract).- Parallel triangulation of nonconvex polytopes.- Kayles on special classes of graphs — An application of Sprague-Grundy theory.- A linear time algorithm for isomorphism of graphs of bounded average genus.- Improved algorithms for routing on two-dimensional grids.- Minimum rectilinear steiner trees for intervals on two parallel lines.- A new characterization of tree medians with applications to distributed algorithms.- The 3-edge-components and a structural description of all 3-edge-cuts in a graph.- On assembly of four-connected graphs.- On the homogeneous decomposition of graphs.- Embeddings in recursive combinatorial networks.- On shortcutting digraphs.- An efficient algorithm to recognize prime undirected graphs.- On the complexity of partial order properties.- Probabilistic graph grammars.- Single vs. double pushout derivations of graphs.- Hexagonal grid drawings.- Graph algorithms = iteration + data structures?.- Petri nets, hypergraphs and conflicts (preliminary version).- Analysis and manipulation of Boolean functions in terms of decision graphs.- The expressiveness of silence: Tight bounds for synchronous communication of information using bits and silence.- The power and the limitations of local computations on graphs.Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Neuestes ähnliches Buch:
9780387194226 Graph-Theoretic Concepts in Computer Science: International Workshop WG'87, Kloster Banz/Staffelstein, FRG, June 29 - July 1, 1987, Proceedings (Lecture Notes In Computer Science 314) (Gottler, H)
- 9780387194226 Graph-Theoretic Concepts in Computer Science: International Workshop WG'87, Kloster Banz/Staffelstein, FRG, June 29 - July 1, 1987, Proceedings (Lecture Notes In Computer Science 314) (Gottler, H)
- 9783540194224 Graph-Theoretic Concepts in Computer Science (Goettler, Herbert Schneider, Hans-Juergen)
- Graph-Theoretic Concepts in Computer Science: International Workshop WG '87, Kloster Banz/Staffelstein, FRG, June 29 - July 1, 1987. Proceedings (Lecture Notes in Computer Science) (2008-06-13) (unknown)
< zum Archiv...