- 5 Résultats
prix le plus bas: € 42,79, prix le plus élevé: € 79,99, prix moyen: € 66,92
1
Graph-Theoretic Concepts in Computer Science : 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007, Revised Papers - Wolfgang Demtroder
Commander
sur hive.co.uk
£ 57,79
(environ € 66,53)
Commander
Détails et expédition
Lien sponsorisé
Wolfgang Demtroder:

Graph-Theoretic Concepts in Computer Science : 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007, Revised Papers - nouveau livre

2007, ISBN: 9783540748397

The 33rd International Conference "Workshop on Graph-Theoretic Concepts in Computer Science" (WG 2007) took place in the Conference Center in old castleinDornburgnearJena,Germany,June21-2… Plus…

No. 9783540748397. Frais d'envoiInstock, Despatched same working day before 3pm, zzgl. Versandkosten., Livraison non-comprise
fermer(X)
2
Graph-Theoretic Concepts in Computer Science : 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007, Revised Papers - Lizhuang Ma
Commander
sur hive.co.uk
£ 57,79
(environ € 65,28)
Commander
Détails et expédition
Lien sponsorisé

Lizhuang Ma:

Graph-Theoretic Concepts in Computer Science : 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007, Revised Papers - nouveau livre

2007, ISBN: 9783540748397

The 33rd International Conference "Workshop on Graph-Theoretic Concepts in Computer Science" (WG 2007) took place in the Conference Center in old castleinDornburgnearJena,Germany,June21-2… Plus…

No. 9783540748397. Frais d'envoiInstock, Despatched same working day before 3pm, zzgl. Versandkosten., Livraison non-comprise
fermer(X)
3
Graph-Theoretic Concepts in Computer Science
Commander
sur Springer.com
€ 42,79
Envoi: € 0,001
Commander
Détails du fournisseur
Lien sponsorisé
Graph-Theoretic Concepts in Computer Science - nouveau livre

2007

ISBN: 9783540748397

The 33rd International Conference “Workshop on Graph-Theoretic Concepts in Computer Science” (WG 2007) took place in the Conference Center in old castleinDornburgnearJena,Germany,June21–2… Plus…

Nr. 978-3-540-74839-7. Frais d'envoiWorldwide free shipping, , DE. (EUR 0.00)
fermer(X)
4
Graph-Theoretic Concepts in Computer Science
Commander
sur Hugendubel.de
€ 79,99
Envoi: € 0,001
Commander
Détails du fournisseur
Lien sponsorisé
Graph-Theoretic Concepts in Computer Science - nouveau livre

2007, ISBN: 9783540748397

Graph-Theoretic Concepts in Computer Science ab 79.99 € als pdf eBook: 33rd International Workshop WG 2007 Dornburg Germany June 21-23 2007 Revised Papers. Aus dem Bereich: eBooks, Sachth… Plus…

Nr. 25382094. Frais d'envoi, , DE. (EUR 0.00)
fermer(X)
5
Graph-Theoretic Concepts in Computer Science
Commander
sur eBook.de
€ 79,99
Envoi: € 0,001
Commander
Détails du fournisseur
Lien sponsorisé
Graph-Theoretic Concepts in Computer Science - nouveau livre

2007, ISBN: 9783540748397

Graph-Theoretic Concepts in Computer Science - 33rd International Workshop WG 2007 Dornburg Germany June 21-23 2007 Revised Papers: ab 79.99 € eBooks > Sachthemen & Ratgeber > Computer & … Plus…

Frais d'envoiin stock, , , DE. (EUR 0.00)
fermer(X)
1Comme certaines plateformes ne transmettent pas les conditions d'expédition et que celles-ci peuvent dépendre du pays de livraison, du prix d'achat, du poids et de la taille de l'article, d'une éventuelle adhésion de la plateforme, d'une livraison directe par la plateforme ou via un prestataire tiers (Marketplace), etc. il est possible que les frais de livraison indiqués par eurolivre ne correspondent pas à ceux de la plateforme qui propose l'article.

Données bibliographiques du meilleur livre correspondant

Détails sur le livre
Graph-Theoretic Concepts in Computer Science
Auteur:
Titre:
ISBN:

9783540748397

Informations détaillées sur le livre - Graph-Theoretic Concepts in Computer Science


EAN (ISBN-13): 9783540748397
Date de parution: 2007
Editeur: Springer Berlin Heidelberg

Livre dans la base de données depuis 2016-03-20T14:59:40+01:00 (Paris)
Page de détail modifiée en dernier sur 2023-10-29T09:11:56+01:00 (Paris)
ISBN/EAN: 9783540748397

ISBN - Autres types d'écriture:
978-3-540-74839-7
Autres types d'écriture et termes associés:
Auteur du livre: andreas müller, müller dieter, andreas muller
Titre du livre: graph theoretic concepts computer science

Données de l'éditeur

Auteur: Andreas Brandstädt; Dieter Kratsch; Haiko Müller
Titre: Theoretical Computer Science and General Issues; Lecture Notes in Computer Science; Graph-Theoretic Concepts in Computer Science - 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007, Revised Papers
Editeur: Springer; Springer Berlin
344 Pages
Date de parution: 2007-12-06
Berlin; Heidelberg; DE
Langue: Anglais
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XIII, 344 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Algorithms; Graph; Graph theory; Layout; algorithm; complexity; computer; computer science; modeling; algorithm analysis and problem complexity; data structures; C; Theory of Computation; Computer Modelling; Algorithms; Discrete Mathematics in Computer Science; Numerical Analysis; Data Science; Computer Science; Computermodellierung und -simulation; Algorithmen und Datenstrukturen; Mathematik für Informatiker; Diskrete Mathematik; Numerische Mathematik; Datenbanken; BC

Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs.- Recognizing Bipartite Tolerance Graphs in Linear Time.- Graph Searching in a Crime Wave.- Monotonicity of Non-deterministic Graph Searching.- Tree-Width and Optimization in Bounded Degree Graphs.- On Restrictions of Balanced 2-Interval Graphs.- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions.- The Clique-Width of Tree-Power and Leaf-Power Graphs.- NLC-2 Graph Recognition and Isomorphism.- A Characterisation of the Minimal Triangulations of Permutation Graphs.- The 3-Steiner Root Problem.- On Finding Graph Clusterings with Maximum Modularity.- On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs.- A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs.- Approximation Algorithms for Geometric Intersection Graphs.- An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem.- Mixing 3-Colourings in Bipartite Graphs.- Minimum-Weight Cycle Covers and Their Approximability.- On the Number of ?-Orientations.- Complexity and Approximation Results for the Connected Vertex Cover Problem.- Segmenting Strings Homogeneously Via Trees.- Characterisations and Linear-Time Recognition of Probe Cographs.- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete.- Proper Helly Circular-Arc Graphs.- Pathwidth of Circular-Arc Graphs.- Characterization and Recognition of Digraphs of Bounded Kelly-width.- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms.- Obtaining a Planar Graph by Vertex Deletion.- Mixed Search Number and Linear-Width of Interval and Split Graphs.- Lower Bounds for Three Algorithms for theTransversal Hypergraph Generation.- The Complexity of Bottleneck Labeled Graph Problems.
< pour archiver...