Algorithms on Trees and Graphs
Autor Gabriel Valienteen Limba Engleză Paperback – 30 noi 2010
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (2) | 379.50 lei 6-8 săpt. | |
| Springer International Publishing – 13 oct 2022 | 379.50 lei 6-8 săpt. | |
| Springer Berlin, Heidelberg – 30 noi 2010 | 452.70 lei 39-44 zile | |
| Hardback (2) | 444.48 lei 6-8 săpt. | +34.31 lei 6-12 zile |
| Springer International Publishing – 12 oct 2021 | 458.32 lei 3-5 săpt. | +34.31 lei 6-12 zile |
| Springer Berlin, Heidelberg – 5 sep 2002 | 444.48 lei 6-8 săpt. |
Preț: 452.70 lei
Preț vechi: 565.88 lei
-20% Nou
Puncte Express: 679
Preț estimativ în valută:
80.09€ • 94.16$ • 70.15£
80.09€ • 94.16$ • 70.15£
Carte tipărită la comandă
Livrare economică 26-31 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642078095
ISBN-10: 3642078095
Pagini: 508
Ilustrații: 1
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.7 kg
Ediția:Softcover reprint of the original 1st ed. 2002
Editura: Springer Berlin, Heidelberg
Colecția Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642078095
Pagini: 508
Ilustrații: 1
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.7 kg
Ediția:Softcover reprint of the original 1st ed. 2002
Editura: Springer Berlin, Heidelberg
Colecția Springer
Locul publicării:Berlin, Heidelberg, Germany
V-ar putea interesa
-
Cybersecurity and Applied MathematicsLeigh Metcalf-31%Preț: 317.06 lei457.14 lei -
-23%Preț: 464.09 lei602.72 lei -
Preț: 404.05 lei -
Algebra for CryptologistsAlko R. MeijerPreț: 524.31 lei -
-20%Preț: 332.10 lei415.13 lei -
-18%Preț: 1335.95 lei1629.20 lei -
-18%Preț: 910.58 lei1110.47 lei -
Soft Methods for Data ScienceMaria Brigida Ferraro-20%Preț: 1234.14 lei1542.68 lei -
-20%Preț: 325.30 lei406.63 lei -
-20%Preț: 327.99 lei409.99 lei -
-20%Preț: 312.30 lei390.38 lei -
-20%Preț: 319.60 lei399.50 lei -
Combinatorial Pattern MatchingMoshe Lewenstein-20%Preț: 327.92 lei409.90 lei -
-20%Preț: 396.70 lei495.88 lei -
-15%Preț: 613.00 lei721.18 lei -
Programmieren mit Maple VJ.S. Devitt-20%Preț: 410.19 lei512.74 lei -
Fuzzy-Begriffe: Formale Begriffsanalyse unscharfer DatenSilke Pollandt-20%Preț: 340.44 lei425.55 lei -
Mathematical Foundations of Computer Science 2012Branislav Rovan-20%Preț: 705.01 lei881.26 lei -
Coalgebraic Methods in Computer ScienceDirk Pattinson-20%Preț: 319.52 lei399.41 lei -
Relational and Algebraic Methods in Computer ScienceWolfram Kahl-20%Preț: 324.85 lei406.06 lei -
Machine Learning and Knowledge Discovery in DatabasesPeter A. Flach-20%Preț: 351.60 lei439.50 lei
Public țintă
GraduateDescriere
Graph
algorithms
is
a
well-established
subject
in
mathematics
and
computer
science.
Beyond
classical
application
fields,
like
approximation,
combinatorial
optimization,
graphics,
and
operations
research,
graph
algorithms
have
recently
attracted
increased
attention
from
computational
molecular
biology
and
computational
chemistry.
Centered
around
the
fundamental
issue
of
graph
isomorphism,
this
text
goes
beyond
classical
graph
problems
of
shortest
paths,
spanning
trees,
flows
in
networks,
and
matchings
in
bipartite
graphs.
Advanced
algorithmic
results
and
techniques
of
practical
relevance
are
presented
in
a
coherent
and
consolidated
way.
This
book
introduces
graph
algorithms
on
an
intuitive
basis
followed
by
a
detailed
exposition
in
a
literate
programming
style,
with
correctness
proofs
as
well
as
worst-case
analyses.
Furthermore,
full
C++
implementations
of
all
algorithms
presented
are
given
using
the
LEDA
library
of
efficient
data
structures
and
algorithms.
Numerous
illustrations,
examples,
and
exercises,
and
a
comprehensive
bibliography
support
students
and
professionals
in
using
the
book
as
a
text
and
source
of
reference
Cuprins
1.
Introduction.-
2.
Algorithmic
Techniques.-
3.
Tree
Traversal.-
4.
Tree
Isomorphism.-
5.
Graph
Traversal.-
6.
Clique,
Independent
Set,
and
Vertex
Cover.-
7.
Graph
Isomorphism.-
IV.
Appendices.-
A.
An
Overview
of
LEDA.-
A.1
Introduction.-
A.2
Data
Structures.-
A.3
Fundamental
Graph
Algorithms.-
A.4
A
Simple
Representation
of
Trees.-
A.5
A
Simple
Implementation
of
Radix
Sort.-
Bibliographic
Notes.-
B.
Interactive
Demonstration
of
Graph
Algorithms.-
C.
Program
Modules.
Recenzii
From
the
reviews:
"The main theme of this (research) monograph on graph algorithms is the isomorphism problem (for trees and graphs). Algorithms are both described on an intuitive basis and presented (and discussed) in detail using Knuth’s literate programming style (C++, using the LEDA library). Besides offering an introduction to an interesting and important subject (with applications, e.g., in biology and chemistry), it also is a valuable (and unified) reference to material previously only available in research papers." (P. Schmitt, Monatshefte für Mathematik, Vol. 142 (4), 2004)
"The book goes beyond classical graph problems and addresses algorithmic problems with practical applications. … will have a great potential in the hands of a dedicated teacher who is both willing and capable of using the software. Because much of the material in the book was previously only available in specialized research literature, this book will be very valuable also for researchers of algorithmic graph theory. This richly illustrated book has an extensive bibliography and several appendices describing the software." (Matti Vuorinen, Zentralblatt MATH, Vol. 1007, 2003)
"The main theme of this (research) monograph on graph algorithms is the isomorphism problem (for trees and graphs). Algorithms are both described on an intuitive basis and presented (and discussed) in detail using Knuth’s literate programming style (C++, using the LEDA library). Besides offering an introduction to an interesting and important subject (with applications, e.g., in biology and chemistry), it also is a valuable (and unified) reference to material previously only available in research papers." (P. Schmitt, Monatshefte für Mathematik, Vol. 142 (4), 2004)
"The book goes beyond classical graph problems and addresses algorithmic problems with practical applications. … will have a great potential in the hands of a dedicated teacher who is both willing and capable of using the software. Because much of the material in the book was previously only available in specialized research literature, this book will be very valuable also for researchers of algorithmic graph theory. This richly illustrated book has an extensive bibliography and several appendices describing the software." (Matti Vuorinen, Zentralblatt MATH, Vol. 1007, 2003)
Textul de pe ultima copertă
Graph
algorithms
is
a
well-established
subject
in
mathematics
and
computer
science.
Beyond
classical
application
fields,
like
approximation,
combinatorial
optimization,
graphics,
and
operations
research,
graph
algorithms
have
recently
attracted
increased
attention
from
computational
molecular
biology
and
computational
chemistry.
Centered
around
the
fundamental
issue
of
graph
isomorphism,
this
text
goes
beyond
classical
graph
problems
of
shortest
paths,
spanning
trees,
flows
in
networks,
and
matchings
in
bipartite
graphs.
Advanced
algorithmic
results
and
techniques
of
practical
relevance
are
presented
in
a
coherent
and
consolidated
way.
This
book
introduces
graph
algorithms
on
an
intuitive
basis
followed
by
a
detailed
exposition
in
a
literate
programming
style,
with
correctness
proofs
as
well
as
worst-case
analyses.
Furthermore,
full
C++
implementations
of
all
algorithms
presented
are
given
using
the
LEDA
library
of
efficient
data
structures
and
algorithms.
Numerous
illustrations,
examples,
and
exercises,
and
a
comprehensive
bibliography
support
students
and
professionals
in
using
the
book
as
a
text
and
source
of
reference
Caracteristici
Algorithms
are
first
presented
on
an
intuitive
basis,
followed
by
a
detailed
exposition
in
a
literate
programming
style
Correctness proofs are given, together with a worst-case analysis of the algorithms
Full C++ implementation of all the algorithms using the LEDA library
Interactive demonstration including animations
An extensive chapter is devoted to the algorithmic techniques used in the book
Correctness proofs are given, together with a worst-case analysis of the algorithms
Full C++ implementation of all the algorithms using the LEDA library
Interactive demonstration including animations
An extensive chapter is devoted to the algorithmic techniques used in the book
Notă biografică
Gabriel Valiente, PhD, is an accredited Full Professor at the Department of Computer Science and a member of the Algorithms, Bioinformatics, Complexity and Formal Methods Research Group of the Technical University of Catalonia in Barcelona, Spain. He has been lecturing on Data Structures and Algorithms at the undergraduate level and Advanced Graph Algorithms at the graduate level over the last several years. His current research is centered on combinatorial algorithms on graphs and, in particular, algorithms for comparing trees and graphs, with emphasis on algorithms in computational biology and bioinformatics.