- 4 Ergebnisse
Kleinster Preis: € 42,79, größter Preis: € 71,68, Mittelwert: € 64,31
1
Graph-Theoretic Concepts in Computer Science - Jan van Leeuwen
Bestellen
bei Springer.com
€ 71,68
Bestellen
Details und Versand
gesponserter Link
Jan van Leeuwen:

Graph-Theoretic Concepts in Computer Science - neues Buch

ISBN: 9783540483854

This volume contains the proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science, WG '93, held near Utrecht, The Netherlands, in 1993. The papers ar… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten.
zuklappen (X)
2
Graph-Theoretic Concepts in Computer Science
Bestellen
bei Springer.com
€ 42,79
Bestellen
Details und Versand
gesponserter Link
Graph-Theoretic Concepts in Computer Science - neues Buch

ISBN: 9783540483854

This volume contains the proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science, WG '93, held near Utrecht, The Netherlands, in 1993. The papers ar… Mehr…

Nr. 978-3-540-48385-4. Versandkosten:Worldwide free shipping, , zzgl. Versandkosten.
zuklappen (X)
3
Graph-Theoretic Concepts in Computer Science - Jan van Leeuwen
Bestellen
bei Springer.com
€ 71,39
Bestellen
Details und Versand
gesponserter Link
Jan van Leeuwen:
Graph-Theoretic Concepts in Computer Science - neues Buch

ISBN: 9783540483854

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

  - Versandkosten:zzgl. Versandkosten
zuklappen (X)
4
Graph-Theoretic Concepts in Computer Science - Jan van Leeuwen
Bestellen
bei Springer.com
€ 71,39
Bestellen
Details und Versand
gesponserter Link
Jan van Leeuwen:
Graph-Theoretic Concepts in Computer Science - neues Buch

ISBN: 9783540483854

Computer Science; Theory of Computation; Discrete Mathematics; Computer Applications; Algorithm Analysis and Problem Complexity; Combinatorics; Logics and Meanings of Programs Graph, Grap… 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:

9783540483854

Detailangaben zum Buch - Graph-Theoretic Concepts in Computer Science


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

Buch in der Datenbank seit 2017-06-04T22:03:30+02:00 (Zurich)
Detailseite zuletzt geändert am 2023-12-02T15:34:30+01:00 (Zurich)
ISBN/EAN: 9783540483854

ISBN - alternative Schreibweisen:
978-3-540-48385-4
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: van leeuwen
Titel des Buches: graph theoretic concepts computer science

Daten vom Verlag:

Autor/in: Jan van Leeuwen
Titel: Lecture Notes in Computer Science; Graph-Theoretic Concepts in Computer Science - 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16 - 18, 1993. Proceedings
Verlag: Springer; Springer Berlin
437 Seiten
Erscheinungsjahr: 2005-06-29
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XI, 437 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Graph; Graph-Algorithmen; Kombinatorische Algorithmen; Layout; algorithm; algorithms; combinatorial algorithms; distributed algorithms; graph algorithms; graph theory; network theory; algorithm analysis and problem complexity; combinatorics; C; Theory of Computation; Discrete Mathematics; Computer and Information Systems Applications; Algorithms; Computer Science Logic and Foundations of Programming; Computer Science; Diskrete Mathematik; Angewandte Informatik; Algorithmen und Datenstrukturen; BC

Near-optimal dominating sets in dense random graphs in polynomial expected time.- Approximating minimum weight perfect matchings for complete graphs satisfying the triangle inequality.- Hierarchically specified unit disk graphs.- Bounded tree-width and LOGCFL.- On reduction algorithms for graphs with small treewidth.- Algorithms and complexity of sandwich problems in graphs (extended abstract).- On-line graph algorithms for incremental compilation.- Average case analysis of fully dynamic connectivity for directed graphs.- Fully dynamic maintenance of vertex cover.- Dynamic algorithms for graphs with treewidth 2.- Short disjoint cycles in graphs with degree constraints.- Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs.- Towards a solution of the Holyer's problem.- Graphs, hypergraphs and hashing.- Coloring k-colorable graphs in constant expected parallel time.- Deciding 3-colourability in less than O(1.415n) steps.- A rainbow about T-colorings for complete graphs.- Approximating the chromatic polynomial of a graph.- Asteroidal triple-free graphs.- The parallel complexity of elimination ordering procedures.- Dually chordal graphs.- The size of reduced OBDDs and optimal read-once branching programs for almost all Boolean functions.- Regular marked Petri nets.- The asynchronous committee meeting problem.- Gossiping in vertex-disjoint paths mode in interconnection networks.- The folded Petersen network: A new versatile multiprocessor interconnection topology.- Fast load balancing in Cayley graphs and in circuits.- Concurrent flows and packet routing in Cayley graphs (Preliminary version).- On multi-label linear interval routing schemes.- An ‘All pairs shortest paths’ distributed algorithm using 2n 2 messages.- Linear layouts ofgeneralized hypercubes.- Graph ear decompositions and graph embeddings.- Improved bounds for the crossing numbers on surfaces of genus g.- Two algorithms for finding rectangular duals of planar graphs.- A more compact visibility representation.
< zum Archiv...