ISBN: 9783540463108
This volume gives the proceedings of WG '90, the 16th in a series of workshops. The aim of the workshop series is to contribute to integration in computer science by applying graph-theore… Mehr…
Springer.com new in stock. Versandkosten:zzgl. Versandkosten. (EUR 0.00) Details... |
ISBN: 9783540463108
This volume gives the proceedings of WG '90, the 16th in a series of workshops. The aim of the workshop series is to contribute to integration in computer science by applying graph-theore… Mehr…
Springer.com Nr. 978-3-540-46310-8. Versandkosten:Worldwide free shipping, , DE. (EUR 0.00) Details... |
ISBN: 9783540463108
Computer Science; Theory of Computation; Algorithm Analysis and Problem Complexity; Combinatorics; Computation by Abstract Devices; Data Structures; Logic Design Algorithmus, Concurrency,… Mehr…
Springer.com Versandkosten:zzgl. Versandkosten Details... |
ISBN: 9783540463108
Computer Science; Theory of Computation; Algorithm Analysis and Problem Complexity; Combinatorics; Computation by Abstract Devices; Data Structures; Logic Design Algorithmus, Concurrency,… Mehr…
Springer.com Versandkosten:zzgl. Versandkosten. Details... |
ISBN: 9783540463108
This volume gives the proceedings of WG '90, the 16th in a series of workshops. The aim of the workshop series is to contribute to integration in computer science by applying graph-theore… Mehr…
ISBN: 9783540463108
This volume gives the proceedings of WG '90, the 16th in a series of workshops. The aim of the workshop series is to contribute to integration in computer science by applying graph-theore… Mehr…
ISBN: 9783540463108
Computer Science; Theory of Computation; Algorithm Analysis and Problem Complexity; Combinatorics; Computation by Abstract Devices; Data Structures; Logic Design Algorithmus, Concurrency,… Mehr…
ISBN: 9783540463108
Computer Science; Theory of Computation; Algorithm Analysis and Problem Complexity; Combinatorics; Computation by Abstract Devices; Data Structures; Logic Design Algorithmus, Concurrency,… Mehr…
Bibliographische Daten des bestpassenden Buches
Autor: | |
Titel: | |
ISBN-Nummer: |
Detailangaben zum Buch - Graph-Theoretic Concepts in Computer Science
EAN (ISBN-13): 9783540463108
Herausgeber: Springer Science+Business Media
Buch in der Datenbank seit 2017-01-29T17:51:15+01:00 (Zurich)
Detailseite zuletzt geändert am 2024-02-09T16:24:30+01:00 (Zurich)
ISBN/EAN: 9783540463108
ISBN - alternative Schreibweisen:
978-3-540-46310-8
Alternative Schreibweisen und verwandte Suchbegriffe:
Titel des Buches: graph theoretic concepts computer science
Daten vom Verlag:
Autor/in: Rolf H. Möhring
Titel: Lecture Notes in Computer Science; Graph-Theoretic Concepts in Computer Science - 16th International Workshop WG '90, Berlin, Germany, June 20-22, 1990
Verlag: Springer; Springer Berlin
367 Seiten
Erscheinungsjahr: 2005-07-02
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XIII, 367 p.
EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Algorithmus; Concurrency; Graph theory; Graphentheorie; Komplexität; Parallelität; VLSI technology; VLSI-Technologie; algorithms; automata; complexity; databases; geometry; logic; vertices; algorithm analysis and problem complexity; combinatorics; data structures; C; Theory of Computation; Algorithms; Discrete Mathematics; Data Science; Logic Design; Computer Science; Algorithmen und Datenstrukturen; Diskrete Mathematik; Datenbanken; Rechnerarchitektur und Logik-Entwurf; BC
Optimal parallel algorithms for sparse graphs.- Finding minimally weighted subgraphs.- On the complexity of some coloring games.- A generalized best-first search method in graphs.- Avoiding matrix multiplication.- Induced subraph isomorphism for cographs is NP-complete.- On feedback problems in planar digraphs.- Recognizing binary hamming graphs in O(n 2 log n) time.- Vertex-disjoint trees and boundary single-layer routing.- Bounds on the quality of approximate solutions to the group Steiner problem.- Two polynomial problems in PLA folding.- The VLSI layout problem in various embedding models.- Approximating the minimum net expansion: Near optimal solutions to circuit partitioning problems.- Deterministic message routing in faulty hypercubes.- On complexity of a message-routing strategy for multicomputer systems.- Embeddings of treelike graphs into 2-dimensional meshes.- Diagnosis of t/s-diagnosable systems.- Deciding 1-solvability of distributed task is NP-hard.- Remarks on some concurrency measures.- On the rectilinear art gallery problem algorithmic aspects.- Separation problems and circular arc systems.- Genus of orders and lattices.- Comparing the expressibility of two languages formed using NP-complete graph operators.- Decomposition of linear recursive logic programs.- On the transition graphs of automata and grammars.- Algebraic approach to graph transformation based on single pushout derivations.This volume gives the proceedings of WG '90, organized into sections on: Graph algorithms and complexity, VLSI layout, Multiprocessor systems and concurrency, Computational geometry, Graphs, languages and databases, Graph grammars.
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...