bokomslag Analysis of Algorithms for Graph Pattern Matching Problems
Vetenskap & teknik

Analysis of Algorithms for Graph Pattern Matching Problems

Dilip Kumar Shaw

Pocket

669:-

Funktionen begränsas av dina webbläsarinställningar (t.ex. privat läge).

Uppskattad leveranstid 7-11 arbetsdagar

Fri frakt för medlemmar vid köp för minst 249:-

  • 72 sidor
  • 2018
Analysis of Algorithms for Graph Pattern Matching Problems is designed to serve as a reference book for researchers. This book is primarily deals with the introductory concept of graph, graph pattern matching, graph isomorphism and their applications. A decision tree approach is proposed to solve graph pattern matching problem. This book also covers different algorithms for pattern matching problem. Complexity analysis and experimental result are also discussed in this book. Salient Features: Introductory concept of graph pattern matching and graph isomorphism Different algorithms for graph pattern matching problem Comparative analysis of algorithms Applications of graph pattern matching problem
  • Författare: Dilip Kumar Shaw
  • Format: Pocket/Paperback
  • ISBN: 9786139836635
  • Språk: Engelska
  • Antal sidor: 72
  • Utgivningsdatum: 2018-05-16
  • Förlag: LAP Lambert Academic Publishing