Graph-Theoretic Concepts in Computer Science 23rd International Workshop, WG'97, Berlin, Germany, June 18-20, 1997. Proceedings - neues Buch
1997, ISBN: 3540637575
1997 Kartoniert / Broschiert Algorithmus, Datenverarbeitung / Datenverschlüsselung, Kryptografie, EDV / Theorie / Informatik / Mathematik, Kombinatorik, Mathematik, Diskrete Mathematik,… Mehr…
Achtung-Buecher.de MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) Details... |
Graph-Theoretic Concepts in Computer Science 23rd International Workshop, WG'97, Berlin, Germany, June 18-20, 1997. Proceedings - neues Buch
1997, ISBN: 3540637575
1997 Kartoniert / Broschiert Algorithmus, Datenverarbeitung / Datenverschlüsselung, Kryptografie, EDV / Theorie / Informatik / Mathematik, Kombinatorik, Mathematik, Diskrete Mathematik,… Mehr…
Achtung-Buecher.de MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) Details... |
Graph-Theoretic Concepts in Computer Science 23rd International Workshop, WG'97, Berlin, Germany, June 18-20, 1997. Proceedings - neues Buch
1997, ISBN: 3540637575
1997 Kartoniert / Broschiert Algorithmus, Datenverarbeitung / Datenverschlüsselung, Kryptografie, EDV / Theorie / Informatik / Mathematik, Kombinatorik, Mathematik, Diskrete Mathematik,… Mehr…
Achtung-Buecher.de MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) Details... |
1997, ISBN: 9783540637578
23rd International Workshop, WG'97, Berlin, Germany, June 18-20, 1997. Proceedings, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 1997
lehmanns.de Versandkosten:Versand in 10-14 Tagen. (EUR 0.00) Details... |
Graph-Theoretic Concepts in Computer Science: 23rd International Workshop, WG'97, Berlin, Germany, June 18-20, 1997. Proceedings (Lecture Notes in Computer Science, 1335) - Taschenbuch
1997, ISBN: 9783540637578
Paperback. Fine. Paperback., 5
Biblio.co.uk |
Graph-Theoretic Concepts in Computer Science 23rd International Workshop, WG'97, Berlin, Germany, June 18-20, 1997. Proceedings - neues Buch
1997, ISBN: 3540637575
1997 Kartoniert / Broschiert Algorithmus, Datenverarbeitung / Datenverschlüsselung, Kryptografie, EDV / Theorie / Informatik / Mathematik, Kombinatorik, Mathematik, Diskrete Mathematik,… Mehr…
Möhring, Rolf H. (Herausgeber):
Graph-Theoretic Concepts in Computer Science 23rd International Workshop, WG'97, Berlin, Germany, June 18-20, 1997. Proceedings - neues Buch1997, ISBN: 3540637575
1997 Kartoniert / Broschiert Algorithmus, Datenverarbeitung / Datenverschlüsselung, Kryptografie, EDV / Theorie / Informatik / Mathematik, Kombinatorik, Mathematik, Diskrete Mathematik,… Mehr…
Graph-Theoretic Concepts in Computer Science 23rd International Workshop, WG'97, Berlin, Germany, June 18-20, 1997. Proceedings - neues Buch
1997
ISBN: 3540637575
1997 Kartoniert / Broschiert Algorithmus, Datenverarbeitung / Datenverschlüsselung, Kryptografie, EDV / Theorie / Informatik / Mathematik, Kombinatorik, Mathematik, Diskrete Mathematik,… Mehr…
1997, ISBN: 9783540637578
23rd International Workshop, WG'97, Berlin, Germany, June 18-20, 1997. Proceedings, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 1997
Bibliographische Daten des bestpassenden Buches
Autor: | |
Titel: | |
ISBN-Nummer: |
Detailangaben zum Buch - Graph-Theoretic Concepts in Computer Science
EAN (ISBN-13): 9783540637578
ISBN (ISBN-10): 3540637575
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 1997
Herausgeber: Springer Berlin
392 Seiten
Gewicht: 0,591 kg
Sprache: eng/Englisch
Buch in der Datenbank seit 2007-05-22T20:20:45+02:00 (Zurich)
Detailseite zuletzt geändert am 2023-12-02T15:34:34+01:00 (Zurich)
ISBN/EAN: 9783540637578
ISBN - alternative Schreibweisen:
3-540-63757-5, 978-3-540-63757-8
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: möhring, mhring, springer, moehring, mohri, mohring
Titel des Buches: graph theoretic concepts computer science, workshop berlin, the 23rd, lecture notes computer science, germany, proceedings international workshop, 1997
Daten vom Verlag:
Autor/in: Rolf H. Möhring
Titel: Lecture Notes in Computer Science; Graph-Theoretic Concepts in Computer Science - 23rd International Workshop, WG'97, Berlin, Germany, June 18-20, 1997. Proceedings
Verlag: Springer; Springer Berlin
382 Seiten
Erscheinungsjahr: 1997-10-29
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
X, 382 p.
BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Algorithms; Graph; Matching; Sim; algorithm; complexity; computer; computer science; programming; sets; algorithm analysis and problem complexity; data structures; combinatorics; Theory of Computation; Algorithms; Discrete Mathematics in Computer Science; Data Science; Discrete Mathematics; Algorithmen und Datenstrukturen; Mathematik für Informatiker; Diskrete Mathematik; Datenbanken; EA
Gadgets, approximation, and linear programming: Improved hardness results for cut and satisfiability problems.- Non-oblivious local search for MAX 2-CCSP with application to MAX DICUT.- On the number of simple cycles in planar graphs.- On the separable-homogeneous decomposition of graphs.- Pseudo-hamiltonian graphs.- Acyclic orientations for deadlock prevention in interconnection networks.- Weak-order extensions of an order.- An upper bound for the maximum cut mean value.- NP-completeness results for minimum planar spanners.- Computing the independence number of dense triangle-free graphs.- Algorithms for the treewidth and minimum fill-in of HHD-free graphs.- Block decomposition of inheritance hierarchies.- Minimal elimination ordering inside a given chordal graph.- On-line algorithms for networks of temporal constraints.- Parallel algorithms for treewidth two.- On optimal graphs embedded into paths and rings, with analysis using l 1-spheres.- On greedy matching ordering and greedy matchable graphs.- Off-line and on-line call-scheduling in stars and trees.- Computational complexity of the Krausz dimension of graphs.- Asteroidal sets in graphs.- Complexity of colored graph covers I. Colored directed multigraphs.- A syntactic approach to random walks on graphs.- Bicliques in graphs II: Recognizing k-path graphs and underlying graphs of line digraphs.- Large networks with small diameter.- The bounded tree-width problem of context-free graph languages.- Structured programs have small tree-width and good register allocation.- A measure of parallelization for the lexicographically first maximal subgraph problems.- Make your enemies transparent.- Optimal fault-tolerant ATM-routings for biconnected graphs.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 (Herbert Göttler/ Hans-Jürgen Schneider)
- 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...