Bøger af K. Erciyes

This textbook discusses the design and implementation of basic algebraic graph algorithms, and algebraic graph algorithms for complex networks, employing matroids whenever possible. The text describes the design of a simple parallel matrix algorithm kernel that can be used for parallel processing of algebraic graph algorithms.

Preface.- Part I: Fundamentals of Discrete Mathematics.- Logic.- Proofs.- Algorithms.- Set Theory.- Relations and Functions.- Sequences, Induction and Recursion.- Introduction to Number Theory.- Counting and Probability.- Boolean Algebra and Combinational Circuits.- Introduction to the Theory of Computation.- Part II: Graph Theory.- Introduction to Graphs.- Trees and Traversals.- Subgraphs.- Connectivity, Network Flows and Shortest Paths.- Graph Applications.- A:.- Pseudocode Conventions.- Index.

This is then followed with a description of the implementation of the concepts in a sample kernel, complete with executable code.Topics and features: introduces the fundamentals of real-time systems, including real-time architecture and distributed real-time systems;