- 5 Ergebnisse
Kleinster Preis: € 66,95, größter Preis: € 109,08, Mittelwert: € 87,23
1
Graph-Theoretic Concepts in Computer Science : 24th International Workshop, WG'98, Smolenice Castle, Slovak Republic, June 18-20, Proceedings - Ondrej Sykora
Bestellen
bei ZVAB.com
€ 76,23
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Ondrej Sykora:

Graph-Theoretic Concepts in Computer Science : 24th International Workshop, WG'98, Smolenice Castle, Slovak Republic, June 18-20, Proceedings - Taschenbuch

1998, ISBN: 3540651950

[EAN: 9783540651956], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], GRAPH - GRAPHENTHEORIE; COMBINATORIALOPTIMIZATION; COMPUTATIONALGEOMETRY; GRAPH; GRAPHALFORITHMS; GRAPHCOMPUTAT… Mehr…

NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)]
zuklappen (X)
2
Graph-Theoretic Concepts in Computer Science by Juraj Hromkovi Paperback | Indigo Chapters
Bestellen
bei Indigo.ca
C$ 151,95
(ca. € 104,95)
Bestellen
Details und Versand
gesponserter Link
Graph-Theoretic Concepts in Computer Science by Juraj Hromkovi Paperback | Indigo Chapters - neues Buch

ISBN: 9783540651956

The International Workshop on Graph-Theoretic Concepts in Computer Science is one of the most traditional and high quality conferences in Computer Science. Previousconferenceswereorganize… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten.
zuklappen (X)
3
Graph-Theoretic Concepts in Computer Science by Juraj Hromkovi Paperback | Indigo Chapters
Bestellen
bei Indigo.ca
C$ 142,95
(ca. € 109,08)
Bestellen
Details und Versand
gesponserter Link
Graph-Theoretic Concepts in Computer Science by Juraj Hromkovi Paperback | Indigo Chapters - neues Buch

ISBN: 9783540651956

The International Workshop on Graph-Theoretic Concepts in Computer Science is one of the most traditional and high quality conferences in Computer Science. Previousconferenceswereorganize… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten.
zuklappen (X)
4
Graph-Theoretic Concepts in Computer Science
Bestellen
bei Orellfuessli.ch
CHF 76,90
(ca. € 78,94)
Versand: € 18,481
Bestellen
Details beim Anbieter
gesponserter Link
Graph-Theoretic Concepts in Computer Science - neues Buch

ISBN: 9783540651956

The International Workshop on Graph-Theoretic Concepts in Computer Science is one of the most traditional and high quality conferences in Computer Science. Previousconferenceswereorganize… Mehr…

Nr. A1000384034. Versandkosten:Lieferzeiten außerhalb der Schweiz 3 bis 21 Werktage, , Versandfertig innert 4 - 7 Werktagen, zzgl. Versandkosten. (EUR 18.48)
zuklappen (X)
5
Graph-Theoretic Concepts in Computer Science - Hromkovic, Juraj Sykora, Ondrej
Bestellen
bei booklooker.de
€ 66,95
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Hromkovic, Juraj Sykora, Ondrej:
Graph-Theoretic Concepts in Computer Science - Erstausgabe

1998, ISBN: 9783540651956

Taschenbuch

[ED: Kartoniert / Broschiert], [PU: Springer Berlin Heidelberg], Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Linear Time Solvable Opti… Mehr…

Versandkosten:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) Moluna GmbH
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 by Juraj Hromkovi Paperback | Indigo Chapters
Autor:
Titel:
ISBN-Nummer:

9783540651956


This book constitutes the thoroughly refereed post-workshop proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'98, held in Smolenice Castle, Slovak Republic, in June 1998.The 30 revised full papers presented were carefully selected from a total of 61 submissions. The papers provide a wealth of new results for various classes of graphs, graph computations, graph algorithms and graph-theoretic applications in computer science.

Detailangaben zum Buch - Graph-Theoretic Concepts in Computer Science by Juraj Hromkovi Paperback | Indigo Chapters


EAN (ISBN-13): 9783540651956
ISBN (ISBN-10): 3540651950
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 1998
Herausgeber: Juraj Hromkovi
404 Seiten
Gewicht: 0,608 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2007-06-04T19:37:39+02:00 (Berlin)
Detailseite zuletzt geändert am 2023-02-27T19:01:04+01:00 (Berlin)
ISBN/EAN: 9783540651956

ISBN - alternative Schreibweisen:
3-540-65195-0, 978-3-540-65195-6
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: sykora, juraj hromkovic, marchetti, parisi presicce
Titel des Buches: slovak, 1998, graph theoretic concepts computer science, republic com, smolenice, lecture notes computer science, wiesbaden international

Daten vom Verlag:

Autor/in: Juraj Hromkovič; Ondrej Sykora
Titel: Lecture Notes in Computer Science; Graph-Theoretic Concepts in Computer Science - 24th International Workshop, WG'98, Smolenice Castle, Slovak Republic, June 18-20, Proceedings
Verlag: Springer; Springer Berlin
394 Seiten
Erscheinungsjahr: 1998-10-14
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
X, 394 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Combinatorial Optimization; Computational Geometry; Graph; Graph Alforithms; Graph Computations; Networking Algorithms; algorithms; computer; computer science; data structures; combinatorics; Theory of Computation; Data Structures and Information Theory; Discrete Mathematics in Computer Science; Data Science; Discrete Mathematics; Algorithmen und Datenstrukturen; Informationstheorie; Mathematik für Informatiker; Diskrete Mathematik; Datenbanken; EA

Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width.- Minus Domination in Small-Degree Graphs.- The Vertex-Disjoint Triangles Problem.- Communication in the Two-Way Listen-in Vertex-Disjoint Paths Mode.- Broadcasting on Anonymous Unoriented Tori.- Families of Graphs Having Broadcasting and Gossiping Properties.- Optical All-to-All Communication in Inflated Networks.- A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking.- A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees.- Rankings of Directed Graphs.- Drawing Planar Partitions II: HH-Drawings.- Triangles in Euclidean Arrangements.- Internally Typed Second-Order Term Graphs.- Compact Implicit Representation of Graphs.- Graphs with Bounded Induced Distance.- Diameter Determination on Restricted Graph Families.- Independent Tree Spanners.- Upgrading Bottleneck Constrained Forests.- Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition.- Improved Compressions of Cube-Connected Cycles Networks.- Efficient Embeddings of Grids into Grids.- Integral Uniform Flows in Symmetric Networks.- Splitting Number is NP-Complete.- Tree Spanners in Planar Graphs.- A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs.- Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases.- Domination and Steiner Tree Problems on Graphs with Few P 4s.- Minimum Fill-In and Treewidth for Graphs Modularly Decomposable into Chordal Graphs.- Interval Completion with the Smallest Max-Degree.- An Estimate of the Tree-Width of a Planar Graph Which Has Not a Given Planar Grid as a Minor..
Includes supplementary material: sn.pub/extras
< zum Archiv...