scholarly journals A survey of graph coloring - its types, methods and applications

2012 ◽  
Vol 37 (3) ◽  
pp. 223-238 ◽  
Author(s):  
Piotr Formanowicz ◽  
Krzysztof Tanaś
Keyword(s):  
Graph Theory ◽  
Graph Coloring ◽  
Cubic Graphs ◽  
The World ◽  
Computer Scientists

Abstract Graph coloring is one of the best known, popular and extensively researched subject in the field of graph theory, having many applications and conjectures, which are still open and studied by various mathematicians and computer scientists along the world. In this paper we present a survey of graph coloring as an important subfield of graph theory, describing various methods of the coloring, and a list of problems and conjectures associated with them. Lastly, we turn our attention to cubic graphs, a class of graphs, which has been found to be very interesting to study and color. A brief review of graph coloring methods (in Polish) was given by Kubale in [32] and a more detailed one in a book by the same author. We extend this review and explore the field of graph coloring further, describing various results obtained by other authors and show some interesting applications of this field of graph theory.

Applications of Machine Learning in Cyber Security

2020 ◽  
pp. 83-103 ◽  
Author(s):  
Charu Virmani ◽  
Tanu Choudhary ◽  
Anuradha Pillai ◽  
Manisha Rani
Keyword(s):  
Machine Learning ◽  
Cyber Security ◽  
Machine Learning Algorithms ◽  
Technological Systems ◽  
The World ◽  
Computer Scientists ◽  
Potential Risks ◽  
To Come ◽  
Time Basis ◽  
Applications Of Machine Learning

With the exponential rise in technological awareness in the recent decades, technology has taken over our lives for good, but with the application of computer-aided technological systems in various domains of our day-to-day lives, the potential risks and threats have also come to the fore, aiming at the various security features that include confidentiality, integrity, authentication, authorization, and so on. Computer scientists the world over have tried to come up, time and again, with solutions to these impending problems. With time, attackers have played out complicated attacks on systems that are hard to comprehend and even harder to mitigate. The very fact that a huge amount of data is processed each second in organizations gave birth to the concept of Big Data, thereby making the systems more adept and intelligent in dealing with unprecedented attacks on a real-time basis. This chapter presents a study about applications of machine learning algorithms in cyber security.

How to Represent the World

2008 ◽  
pp. 214-257
Author(s):  
Azamat Abdoullaev
Keyword(s):  
Information Exchange ◽  
World Knowledge ◽  
Lexical Resources ◽  
Practical Applications ◽  
The World ◽  
Computer Scientists ◽  
Application Potential ◽  
Global Language ◽  
Underlying Mechanisms ◽  
Machine Readable

As far as human knowledge about the world is commonly given in NL expressions and as far as universal ontology is a general science of the world, the examination of its impact on natural language science and technology is among the central topics of many academic workshops and conferences. Ontologists, knowledge engineers, lexicographers, lexical semanticists, and computer scientists are attempting to integrate top-level entity classes with language knowledge presented in extensive corpora and electronic lexical resources. Such a deep quest is mostly motivated by high application potential of reality-driven models of language for knowledge communication and management, information retrieval and extraction, information exchange in software and dialogue systems, all with an ultimate view to transform the World Wide Web into a machine-readable global language resource of world knowledge, the Onto-Semantic Web. One of the practical applications of integrative ontological framework is to discover the underlying mechanisms of representing and processing language content and meaning by cognitive agents, human and artificial. Specifically, to provide the formalized algorithms or rules, whereby machines could derive or attach significance (or signification) from coded signals, both natural signs obtained by sensors and linguistic symbols.

Ubiquitous Music

2015 ◽  
Vol 17 (4) ◽  
pp. 20-28
Author(s):  
Flávio Luiz Schiavoni ◽  
Leandro Costalonga
Keyword(s):  
Computer Science ◽  
Research Field ◽  
Point Of View ◽  
Computer Scientist ◽  
Social Scientists ◽  
The World ◽  
Computer Scientists

Ubimus is a research field that merges Ubicomp and music and studies the influence of ubiquitous devices and applications in Music. This field has been explored by musicians and social scientists around the world helped by a countless number of computer scientists. Nevertheless, it is not easy to a novice computer scientist understand Ubimus concepts and specially how to take part of this research field. Based on this, the authors present in this paper a point of view of Ubimus associating fields in computer science and hardware and software definitions and suggestions to be explored with Ubimus.

scholarly journals The Fan–Raspaud conjecture: A randomized algorithmic approach and application to the pair assignment problem in cubic networks

2012 ◽  
Vol 22 (3) ◽  
pp. 765-778
Author(s):  
Piotr Formanowicz ◽  
Krzysztof Tanaś
Keyword(s):  
Graph Theory ◽  
Computer Networks ◽  
Assignment Problem ◽  
Perfect Matchings ◽  
Cubic Graphs ◽  
Cubic Graph ◽  
Algorithmic Approach ◽  
Edge Colorings ◽  
Mathematical Properties

Abstract It was conjectured by Fan and Raspaud (1994) that every bridgeless cubic graph contains three perfect matchings such that every edge belongs to at most two of them. We show a randomized algorithmic way of finding Fan–Raspaud colorings of a given cubic graph and, analyzing the computer results, we try to find and describe the Fan–Raspaud colorings for some selected classes of cubic graphs. The presented algorithms can then be applied to the pair assignment problem in cubic computer networks. Another possible application of the algorithms is that of being a tool for mathematicians working in the field of cubic graph theory, for discovering edge colorings with certain mathematical properties and formulating new conjectures related to the Fan–Raspaud conjecture.

Affordances. Motivations, and the World Graph Theory

1998 ◽  
Vol 6 (3-4) ◽  
pp. 435-471 ◽  
Author(s):  
Alex Guazzelli ◽  
Mihail Bota ◽  
Fernando J. Corbacho ◽  
Michael A. Arbib
Keyword(s):  
Graph Theory ◽  
The World

scholarly journals Medicinal cupping in the eyes of graph theory

2020 ◽  
Vol 1 (01) ◽  
pp. 44-49
Author(s):  
N.M Hanafi ◽  
Y. Yusof ◽  
M.S. Mohamad ◽  
M.F.A Bakar ◽  
M.A. Ibrahim
Keyword(s):  
Graph Theory ◽  
Human Health ◽  
Healing Process ◽  
Optimal Number ◽  
Simple Graph ◽  
The Body ◽  
Graph Colouring ◽  
Traditional Treatment ◽  
The World ◽  
Definition Of

Medicinal cupping is one of the traditional treatment methods that is trusted to give many benefits to the human health and still practising by various culture and societies around the world. The purposes of this treatment are to allow the toxin leaves the body,to stimulate the muscles and also helping in healing process for various diseases. The process start by placing special heated cups on specific points to create suction, then the points will be punctured. Each disease has specific cupping points to be cupped which located on the human nerves system. All the points actually connected to each other where a simple graph can be formed. Since there are limited studies that discuss medicinal cupping in a mathematics view, thus this research is conducted to introduce the easiest way  on demonstrating the cupping points on the human nerves system by using the idea of graph. Hence, new definition of nerve vertex, nerve edge and nerve graph will be defined. Moreover, the idea of graph colouring will be applied to determine the optimal number of cupping points.

scholarly journals On Bi-gram Graph Attributes

2021 ◽  
Vol 14 (3) ◽  
pp. 78
Author(s):  
Thomas Konstantinovsky ◽  
Matan Mizrachi
Keyword(s):  
Graph Theory ◽  
Graph Coloring ◽  
Semantic Analysis ◽  
Large Datasets ◽  
Corpus Analysis ◽  
Graph Representation ◽  
New Approach ◽  
Graph Density ◽  
Coloring Graph ◽  
Basic Graph

We propose a new approach to text semantic analysis and general corpus analysis using, as termed in this article, a "bi-gram graph" representation of a corpus. The different attributes derived from graph theory are measured and analyzed as unique insights or against other corpus graphs, attributes such as the graph chromatic number and the graph coloring, graph density and graph K-core. We observe a vast domain of tools and algorithms that can be developed on top of the graph representation; creating such a graph proves to be computationally cheap, and much of the heavy lifting is achieved via basic graph calculations. Furthermore, we showcase the different use-cases for the bi-gram graphs and how scalable it proves to be when dealing with large datasets.

Gödel's Incompleteness Theorems

1992 ◽  
Author(s):  
Raymond M. Smullyan
Keyword(s):  
Mathematical Logic ◽  
Number Theory ◽  
Continuum Theory ◽  
Kurt Gödel ◽  
The World ◽  
Computer Scientists ◽  
Incompleteness Theorems ◽  
The Axiom Of Choice ◽  
Gödel’S Incompleteness Theorems ◽  
The Continuum

Kurt Godel, the greatest logician of our time, startled the world of mathematics in 1931 with his Theorem of Undecidability, which showed that some statements in mathematics are inherently "undecidable." His work on the completeness of logic, the incompleteness of number theory, and the consistency of the axiom of choice and the continuum theory brought him further worldwide fame. In this introductory volume, Raymond Smullyan, himself a well-known logician, guides the reader through the fascinating world of Godel's incompleteness theorems. The level of presentation is suitable for anyone with a basic acquaintance with mathematical logic. As a clear, concise introduction to a difficult but essential subject, the book will appeal to mathematicians, philosophers, and computer scientists.

scholarly journals Implementasi Algoritma Greedy Pada Pewarnaan Wilayah Kecamatan Sukodadi Lamongan

2020 ◽  
Vol 6 (2) ◽  
pp. 29-38
Author(s):  
Umi Maftukhah ◽  
Siti Amiroch ◽  
Mohammad Syaiful Pradana
Keyword(s):  
Graph Theory ◽  
Greedy Algorithm ◽  
Communication Networks ◽  
Graph Coloring ◽  
Operations Research ◽  
Dual Graph ◽  
Transportation Problems ◽  
Minimum Number ◽  
Different Color ◽  
The Greedy Algorithm

Graph theory can be applied in various fields of science such as transportation problems, communication networks, operations research, chemistry, cartography and so on. Graph theory does not only represent structure but in its application, a graph can also be colored. Many problems have graph coloring characteristics such as regional coloring. This regional coloring theory was applied to the map area of ​​Sukodadi District which consists of 20 villages. In this area coloring uses the Greedy algorithm by first making a dual graph consisting of 20 vertices and 43 edges. Based on the results of regional coloring, the minimum number of colors is 4, namely red, blue, green and yellow, with each neighboring village having a different color.

Design of Manufacturing Cells Based on Graph Theory

2012 ◽  
pp. 1734-1748
Author(s):  
José Francisco Ferreira Ribeiro
Keyword(s):  
Graph Theory ◽  
Simulated Annealing ◽  
Tabu Search ◽  
Comparative Study ◽  
Graph Coloring ◽  
Production System ◽  
Job Shop ◽  
Manufacturing Cells ◽  
Threshold Algorithm ◽  
Manufacturing Activity

In this chapter a comparative study is presented between (I) sequential heuristics, (II) simulated annealing, (III) tabu search, and (IV) threshold algorithm for graph coloring and its application for solving the problem of the design of manufacturing cells in a job shop system production. The job shop production system has a very large proportion of all manufacturing activity. The principal concepts of manufacturing cells, graph theory, and heuristics are presented. The results obtained with these algorithms on several examples found in the literature are consistently equivalent with the best solution hitherto known in terms of numbers of inter-cell moves and dimensions of cells.

Sign in / Sign up

Export Citation Format

Share Document