Página inicialGruposDiscussãoMaisZeitgeist
Este site usa cookies para fornecer nossos serviços, melhorar o desempenho, para análises e (se não estiver conectado) para publicidade. Ao usar o LibraryThing, você reconhece que leu e entendeu nossos Termos de Serviço e Política de Privacidade . Seu uso do site e dos serviços está sujeito a essas políticas e termos.
Hide this

Resultados do Google Livros

Clique em uma foto para ir ao Google Livros

Graph Algorithms de Shimon Even
Carregando...

Graph Algorithms (edição: 2011)

de Shimon Even (Autor), Guy Even (Editor)

MembrosResenhasPopularidadeAvaliação médiaConversas
523382,462 (4.2)Nenhum(a)
Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the field. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from the first edition and explains algorithms in a formal but simple language with a direct and intuitive presentation. The book begins by covering basic material, including graphs and shortest paths, trees, depth-first-search, and breadth-first search. The main part of the book is devoted to network flows and applications of network flows, and it ends with chapters on planar graphs and testing graph planarity.… (mais)

Nenhum(a).

Nenhum(a)
Carregando...

Registre-se no LibraryThing tpara descobrir se gostará deste livro.

Ainda não há conversas na Discussão sobre este livro.

Exibindo 3 de 3
It's still a beautiful book. It naturally falls open to Depth-First Search, and to Maximum Flow in a Network. I wonder what I was working on, in those long ago days?

This book is not for the faint of heart. There are no easy code snippets, nor elegant proofs with example algorithms. It earned a place in my permanent library, long ago. ( )
  Lyndatrue | Jan 11, 2014 |
Indeholder "Preface", "1. Paths in Graphs", " 1.1 Introduction to Graph Theory", " 1.2 Computer Representation of Graphs", " 1.3 Euler Graphs", " 1.4 De Bruijn Sequences", " 1.5 Shortest-Path Algorithms", " Problems", " References", "2. Trees", " 2.1 Tree Definitions", " 2.2 Minimum Spanning Tree", " 2.3 Cayley's Theorem", " 2.4 Directed Tree Definitions", " 2.5 The Infinity Lemma", " 2.6 The number of spanning trees", " 2.7 Optimum branchings and directed spanning trees", " 2.8 Directed trees and Euler circuits", " Problems", " References", "3. Depth-First Search", " 3.1 DFS of undirected graphs", " 3.2 Algorithm for nonseparable components", " 3.3 DFS on digraphs", " 3.4 Algorithm for strongly-connected components", " Problems", " References", "4. Ordered Trees", " 4.1 Uniquely decipherable codes", " 4.2 Positional Trees and Huffman's Optimization Problem", " 4.3 Application of the Huffman Tree to Sort-by-Merge Techniques", " 4.4 Catalan Numbers", " Problems", " References", "5. Maximum Flow in a Network", " 5.1 The Ford and Fulkerson algorithm", " 5.2 The Dinic algorithm", " 5.3 Networks with upper and lower bounds", " Problems", " References", "6. Applications of Network Flow Techniques", " 6.1 Zero-one network flow", " 6.2 Vertex connectivity of graphs", " 6.3 Connectivity of digraphs and edge connectivity", " 6.4 Maximum-matching in bipartite graphs", " 6.5 Two problems on PERT-digraphs", " Problems", " References", "7. Planar Graphs", " 7.1 Bridges and Kuratowski's theorem", " 7.2 Equivalence", " 7.3 Euler's theorem", " 7.4 Duality", " Problems", " References", "8. Testing Graph Planarity", " 8.1 Introduction", " 8.2 The Path Addition Algorithm of Hopcroft and Tarjan", " 8.3 Computing an st-Numbering", " 8.4 The vertex addition algorithm of Lempel, Even, and Cederbaum", " Problems", " References", "9. The Theory of NP-completeness", " 9.1 Introduction", " 9.2 The NP class of decision problems", " 9.3 NP-complete problems and Cook's theorem", " 9.4 Three combinatorial problems which are NPC", " Problems", " References", "10. NP-complete graph problems", " 10.1 Clique, independent set and vertex cover", " 10.2 Hamilton paths and circuits", " 10.3 Coloring of graphs", " 10.4 Feedback sets in digraphs", " 10.5 Steiner tree", " 10.6 Maximum cut", " 10.7 Linear arrangement", " 10.8 Multicommodity integral flow", " Problems", " References", "Index".

Lærebog som blev brugt til et kursus, jeg engang fulgte med Sven Skyum som lærer. Sammen med Peter Hillingsøe lavede jeg et program til at finde maximalt flow i en vægtet graf vha MPM algoritmen, som er beskrevet ganske dårligt i denne bog på side 101, men det lærte vi meget af. ( )
  bnielsen | Dec 10, 2012 |
A great book that was a text in one of the most enjoyable courses I ever took. Believe it or not, I still refer to it! ( )
  Atrox | Jun 5, 2007 |
Exibindo 3 de 3
sem resenhas | adicionar uma resenha

Pertence à série

Você deve entrar para editar os dados de Conhecimento Comum.
Para mais ajuda veja a página de ajuda do Conhecimento Compartilhado.
Título canônico
Informação do Conhecimento Comum em inglês. Edite para a localizar na sua língua.
Título original
Títulos alternativos
Data da publicação original
Pessoas/Personagens
Lugares importantes
Eventos importantes
Filmes relacionados
Premiações
Epígrafe
Dedicatória
Primeiras palavras
Citações
Últimas palavras
Aviso de desambiguação
Editores da Publicação
Autores Resenhistas (normalmente na contracapa do livro)
Idioma original
CDD/MDS canônico

Referências a esta obra em recursos externos.

Wikipédia em inglês (2)

Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the field. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from the first edition and explains algorithms in a formal but simple language with a direct and intuitive presentation. The book begins by covering basic material, including graphs and shortest paths, trees, depth-first-search, and breadth-first search. The main part of the book is devoted to network flows and applications of network flows, and it ends with chapters on planar graphs and testing graph planarity.

Não foram encontradas descrições de bibliotecas.

Descrição do livro
Resumo em haiku

Links rápidos

Capas populares

Avaliação

Média: (4.2)
0.5
1
1.5
2
2.5
3 1
3.5
4 2
4.5
5 2

É você?

Torne-se um autor do LibraryThing.

 

Sobre | Contato | LibraryThing.com | Privacidade/Termos | Ajuda/Perguntas Frequentes | Blog | Loja | APIs | TinyCat | Bibliotecas Históricas | Os primeiros revisores | Conhecimento Comum | 155,559,581 livros! | Barra superior: Sempre visível