ISBN: 9783540474159
Graph-theoretic concepts are developed by computer scientists in order to model algorithms, nets, rewriting systems, distributed systems, parallelism, geometric and layout concepts. Their… Mehr…
Springer.com new in stock. Versandkosten:zzgl. Versandkosten. Details... |
ISBN: 9783540474159
Graph-theoretic concepts are developed by computer scientists in order to model algorithms, nets, rewriting systems, distributed systems, parallelism, geometric and layout concepts. Their… Mehr…
Springer.com Nr. 978-3-540-47415-9. Versandkosten:Worldwide free shipping, , DE. (EUR 0.00) Details... |
ISBN: 9783540474159
Computer Science; Theory of Computation; Combinatorics; Computation by Abstract Devices; Computer Communication Networks Algorithms, Graph, Node, Sim, algorithm, complexity, data model, d… Mehr…
Springer.com Versandkosten: EUR 0.00 Details... |
ISBN: 9783540474159
Computer Science; Theory of Computation; Combinatorics; Computation by Abstract Devices; Computer Communication Networks Algorithms, Graph, Node, Sim, algorithm, complexity, data model, d… Mehr…
Springer.com Versandkosten:zzgl. Versandkosten. Details... |
ISBN: 9783540474159
Computer Science; Theory of Computation; Combinatorics; Computation by Abstract Devices; Computer Communication Networks Algorithms, Graph, Node, Sim, algorithm, complexity, data model, d… Mehr…
Springer.com Versandkosten:zzgl. Versandkosten. Details... |
ISBN: 9783540474159
Graph-theoretic concepts are developed by computer scientists in order to model algorithms, nets, rewriting systems, distributed systems, parallelism, geometric and layout concepts. Their… Mehr…
ISBN: 9783540474159
Graph-theoretic concepts are developed by computer scientists in order to model algorithms, nets, rewriting systems, distributed systems, parallelism, geometric and layout concepts. Their… Mehr…
ISBN: 9783540474159
Computer Science; Theory of Computation; Combinatorics; Computation by Abstract Devices; Computer Communication Networks Algorithms, Graph, Node, Sim, algorithm, complexity, data model, d… Mehr…
ISBN: 9783540474159
Computer Science; Theory of Computation; Combinatorics; Computation by Abstract Devices; Computer Communication Networks Algorithms, Graph, Node, Sim, algorithm, complexity, data model, d… Mehr…
ISBN: 9783540474159
Computer Science; Theory of Computation; Combinatorics; Computation by Abstract Devices; Computer Communication Networks Algorithms, Graph, Node, Sim, algorithm, complexity, data model, d… Mehr…
Bibliographische Daten des bestpassenden Buches
Autor: | |
Titel: | |
ISBN-Nummer: |
Detailangaben zum Buch - Graph-Theoretic Concepts in Computer Science
EAN (ISBN-13): 9783540474159
Herausgeber: Springer Science+Business Media
Buch in der Datenbank seit 2016-12-21T12:38:03+01:00 (Berlin)
Detailseite zuletzt geändert am 2023-12-26T14:17:44+01:00 (Berlin)
ISBN/EAN: 9783540474159
ISBN - alternative Schreibweisen:
978-3-540-47415-9
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: schmidt günther, gunther schmidt, gottfried
Titel des Buches: graph theoretic concepts computer science
Daten vom Verlag:
Autor/in: Gottfried Tinhofer; Gunther Schmidt
Titel: Lecture Notes in Computer Science; Graph-Theoretic Concepts in Computer Science - International Workshop WG '86 Bernried, Federal Republic of Germany, June 17-19, 1986, Proceedings
Verlag: Springer; Springer Berlin
314 Seiten
Erscheinungsjahr: 2005-07-14
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
X, 314 p.
EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Algorithms; Graph; Node; Sim; algorithm; complexity; data model; distributed systems; petri net; sets; combinatorics; C; Theory of Computation; Discrete Mathematics; Computer Communication Networks; Computer Science; Diskrete Mathematik; Netzwerk-Hardware; BC
A simple linear-time algorithm to recognize interval graphs.- On approximation algorithms for Steiner's problem in graphs.- Specification of error distances for graphs by precedence graph grammars and fast recognition of similarity.- ADA concurrency specified by graph grammars.- Cabri, an interactive system for graph manipulation.- An interactive graphical manipulation system for higher objects based on relational algebra.- Behaviour preserving refinements of Petri nets.- The bandwidth of planar distributive lattices.- The node visit cost of brother trees.- Searching connected components in very large grid graphs.- A simple implementation of Warshall's algorithm on a vlsi chip.- On some generalizations of outerplanar graphs: Results and open problems.- Recognizing outerplanar graphs in linear time.- Graphs and graph polynomials of interest in chemistry.- Applications of parallel scheduling to perfect graphs.- A graph-theoretic approach for designing fair distributed resource schedulingalgorithms.- Improved diameter bounds for altered graphs.- Separability of sets of polygons.- Centipede graphs and visibility on a cylinder.- The diameter of connected components of random graphs.- An algorithm for testing planarity of hierarchical graphs.- EDM — A data model for electronic CAD/CAM-applications.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...