# APPLICATIONS OF GRAPH THEORY IN COMPUTER SCIENCE ENGINEERING

@inproceedings{Venugopal2015APPLICATIONSOG, title={APPLICATIONS OF GRAPH THEORY IN COMPUTER SCIENCE ENGINEERING}, author={D. Venugopal}, year={2015} }

The field of mathematics plays vital role in various fields. One of the important areas in mathematics is graph theory which is used in structural models. This structural arrangements of various objects or technologies lead to new inventions and modifications in the existing environment for enhancement in those fields. The field graph theory started its journey from the problem of Konigsberg bridge in 1735. This paper gives an overview of the applications of graph theory in heterogeneous fields…

## One Citation

### Implementation and quality measures of graph theory model based image segmentation process in medical application

- Computer Science
- 2021

The proposed method shows good quality image parameters as it has lower MSE, NAE values and is compared with other traditional and graph theory model to analyse the various quality measures calculated for the input of magnetic resonance imaging scan and X-Ray images.

## References

SHOWING 1-10 OF 12 REFERENCES

### Graph Theory

- Computer ScienceGraduate Texts in Mathematics
- 2008

This book provides a systematic treatment of the theory of graphs without sacrificing its intuitive and aesthetic appeal, and is suitable as a textbook for advanced undergraduate and beginning graduate students in mathematics and computer science.

### Graph Theory with Applications to Engineering and Computer Science

- Computer ScienceNetworks
- 1975

This outstanding introductory treatment of graph theory and its applications has had a long life in the instruction of advanced undergraduates and graduate students in all areas that require knowledge of this subject.

### On randomized representations of graphs using short labels

- Computer ScienceSPAA '09
- 2009

Whether the label sizes can be improved if one allows for some probability of mistake when answering a query, and, if so, by how much, is investigated from a probabilistic point of view.

### Implicit representation of graphs

- Computer ScienceSTOC '88
- 1988

The theorems on finite graphs extend to a theorem about the constrained labeling of infinite graphs about graphs of polynomial size.

### Automatic channel allocation for small wireless local area networks using graph colouring algorithm approach

- Computer Science2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754)
- 2004

This article demonstrates how graph colouring can be used as a theoretical basis for a protocol to effectively assign channels to WLAN access points, and gives the outline of the protocol operation.

### Secure group communications using key graphs

- Computer Science, MathematicsTNET
- 2000

It is shown that the group key management service, using any of the three rekeying strategies, is scalable to large groups with frequent joins and leaves, and the average measured processing time per join/leave increases linearly with the logarithm of group size.

### SPX: global authentication using public key certificates

- Computer ScienceProceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy
- 1991

SPX, a reference implementation of an open distributed authentication service architecture based on ISO Standard 9594-9/CCITT X.509 directory public key certificates and hierarchically organized…

### Trust and security: A new look at the Byzantine generals problem

- Computer ScienceNetwork Threats
- 1996

### A Graph Model for Fault-Tolerant Computing Systems

- Computer ScienceIEEE Transactions on Computers
- 1976

An approach to fault-tolerant design is described in which a computing system S and an algorithm A to be executed by S are both defined by graphs whose nodes represent computing facilities. A is…

### Secure Communication in an Unknown Network Using Certificates

- Computer Science, MathematicsASIACRYPT
- 1999

This work presents a protocol that allows secure communication in a network with malicious (Byzantine) faults for which the trust graph, with vertices the processors and edges corresponding to certified public keys, is not known except possibly to the adversary.