Role of Graph theory in the discipline of computing

Krishnendu Basuli

ISBN 10: 6139886104 / ISBN 13: 9786139886104

Published by LAP LAMBERT Academic Publishing, 2018

About this Item

nach der Bestellung gedruckt Neuware - Printed after ordering - A graph is a useful medium for modeling of relevant parts of reality in computer science. In real life, the problem may be infinite dimensions, Design of ingenious information structure for minimizing complexity and redundancy of the problem space are versatile. Given an arbitrary 'n' node graph the problem may be infinite and in some cases it is uncountable infinite. we are limited to finite. And the problem are represented and manipulated in digital computer are also treated in the same token. The question was coding of graphs to represent in a convenient and useful way to the computer. Coding hare like graphic Integer Sequence. It is our try to show that graph theory can be viewed as a unified theory of all combinatorial structure. Any problem which is combinatorial in nature can be solved in terms of graphical structure. A good algorithm for any combinatorial problems can have costly payoff has lead to terrific advances in the state of the art. So our approaches are to make or present simple graph algorithms here. Which when stated in complex way become complex. Some problems are intractable due to lack of improvement of data structure as major criteria.

Seller Inventory # 9786139886104

Bibliographic Details

• Title: Role of Graph theory in the discipline of computing
• Publisher: LAP LAMBERT Academic Publishing
• Publication Date: 2018
• Language: English
• ISBN 10: 6139886104
• ISBN 13: 9786139886104
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 9D millimeters 220 millimeters width by 150 millimeters height by 9 millimeters depth
• Weight: 221 grams

About this title

Synopsis

A graph is a useful medium for modeling of relevant parts of reality in computer science. In real life, the problem may be infinite dimensions, Design of ingenious information structure for minimizing complexity and redundancy of the problem space are versatile. Given an arbitrary 'n' node graph the problem may be infinite and in some cases it is uncountable infinite. we are limited to finite. And the problem are represented and manipulated in digital computer are also treated in the same token. The question was coding of graphs to represent in a convenient and useful way to the computer. Coding hare like graphic Integer Sequence. It is our try to show that graph theory can be viewed as a unified theory of all combinatorial structure. Any problem which is combinatorial in nature can be solved in terms of graphical structure. A good algorithm for any combinatorial problems can have costly payoff has lead to terrific advances in the state of the art. So our approaches are to make or present simple graph algorithms here. Which when stated in complex way become complex. Some problems are intractable due to lack of improvement of data structure as major criteria.