Graph theory

View this topic in
In mathematics and computer science, graph theory is the study of graphs, mathematical structures used to model pairwise relations between objects from a certain collection. (Wikipedia.org)






Conferences related to Graph theory

Back to Top

2021 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)

FUZZ-IEEE 2021 will represent a unique meeting point for scientists and engineers, both from academia and industry, to interact and discuss the latest enhancements and innovations in the field. The topics of the conference will cover all the aspects of theory and applications of fuzzy sets, fuzzy logic and associated approaches (e.g. aggregation operators such as the Fuzzy Integral), as well as their hybridizations with other artificial and computational intelligence techniques.


ICC 2021 - IEEE International Conference on Communications

IEEE ICC is one of the two flagship IEEE conferences in the field of communications; Montreal is to host this conference in 2021. Each annual IEEE ICC conference typically attracts approximately 1,500-2,000 attendees, and will present over 1,000 research works over its duration. As well as being an opportunity to share pioneering research ideas and developments, the conference is also an excellent networking and publicity event, giving the opportunity for businesses and clients to link together, and presenting the scope for companies to publicize themselves and their products among the leaders of communications industries from all over the world.


2020 59th IEEE Conference on Decision and Control (CDC)

The CDC is the premier conference dedicated to the advancement of the theory and practice of systems and control. The CDC annually brings together an international community of researchers and practitioners in the field of automatic control to discuss new research results, perspectives on future developments, and innovative applications relevant to decision making, automatic control, and related areas.


2020 IEEE International Conference on Image Processing (ICIP)

The International Conference on Image Processing (ICIP), sponsored by the IEEE SignalProcessing Society, is the premier forum for the presentation of technological advances andresearch results in the fields of theoretical, experimental, and applied image and videoprocessing. ICIP 2020, the 27th in the series that has been held annually since 1994, bringstogether leading engineers and scientists in image and video processing from around the world.


2020 IEEE International Symposium on Information Theory (ISIT)

Information theory, coding theory, communication theory, signal processing, and foundations of machine learning


More Conferences

Periodicals related to Graph theory

Back to Top

Antennas and Wireless Propagation Letters, IEEE

IEEE Antennas and Wireless Propagation Letters (AWP Letters) will be devoted to the rapid electronic publication of short manuscripts in the technical areas of Antennas and Wireless Propagation.


Automatic Control, IEEE Transactions on

The theory, design and application of Control Systems. It shall encompass components, and the integration of these components, as are necessary for the construction of such systems. The word `systems' as used herein shall be interpreted to include physical, biological, organizational and other entities and combinations thereof, which can be represented through a mathematical symbolism. The Field of Interest: shall ...


Automation Science and Engineering, IEEE Transactions on

The IEEE Transactions on Automation Sciences and Engineering (T-ASE) publishes fundamental papers on Automation, emphasizing scientific results that advance efficiency, quality, productivity, and reliability. T-ASE encourages interdisciplinary approaches from computer science, control systems, electrical engineering, mathematics, mechanical engineering, operations research, and other fields. We welcome results relevant to industries such as agriculture, biotechnology, healthcare, home automation, maintenance, manufacturing, pharmaceuticals, retail, ...


Circuits and Systems for Video Technology, IEEE Transactions on

Video A/D and D/A, display technology, image analysis and processing, video signal characterization and representation, video compression techniques and signal processing, multidimensional filters and transforms, analog video signal processing, neural networks for video applications, nonlinear video signal processing, video storage and retrieval, computer vision, packet video, high-speed real-time circuits, VLSI architecture and implementation for video technology, multiprocessor systems--hardware and software-- ...


Circuits and Systems II: Express Briefs, IEEE Transactions on

Part I will now contain regular papers focusing on all matters related to fundamental theory, applications, analog and digital signal processing. Part II will report on the latest significant results across all of these topic areas.


More Periodicals

Most published Xplore authors for Graph theory

Back to Top

Xplore Articles related to Graph theory

Back to Top

IEE Colloquium on 'Circuit Theory and DSP' (Digest No.037)

IEE Colloquium on Circuit Theory and DSP, 1992

None


Abstract of 'Graph Theory and Electric Networks II'

IRE Transactions on Circuit Theory, 1960

None


Random Networks

Network Science: Theory and Applications, None

This chapter contains sections titled:Generation of Random NetworksDegree Distribution of Random NetworksEntropy of Random NetworksProperties of Random NetworksWeak Ties in Random NetworksRandomization of Regular NetworksAnalysisExercises


IEE Colloquium on 'Bond Graphs in Control' (Digest No.063)

IEE Colloquium on Bond Graphs in Control, 1990

None


Graphs

Network Science: Theory and Applications, None

This chapter contains sections titled:Set‐Theoretic Definition of a GraphMatrix Algebra Definition of a GraphThe Bridges of Königsberg GraphSpectral Properties of GraphsTypes of GraphsTopological StructureGraphs in SoftwareExercises


More Xplore Articles

Educational Resources on Graph theory

Back to Top

IEEE.tv Videos

Deep Graph Learning: Techniques and Applications - Haifeng Chen - IEEE Sarnoff Symposium, 2019
Bayesian Perception & Decision from Theory to Real World Applications
Merge Network for a Non-Von Neumann Accumulate Accelerator in a 3D Chip - Anirudh Jain - ICRC 2018
IMS 2012 Special Sessions: A Retrospective of Field Theory in Microwave Engineering - Magdalena Salazar Palma
IMS 2012 Special Sessions: A Retrospective of Field Theory in Microwave Engineering - David M. Pozar
IMS 2012 Special Sessions: A Retrospective of Field Theory in Microwave Engineering - Constantine A. Balanis
Inspiring Brilliance: The impact of control theory and cybernetics of Maxwell's paper: On governors
IEEE Themes - Distance-Dependent Kronecker Graphs For Modeling Social Networks
IMS 2015: Four scientists who saved Maxwells Theory
Spiking Network Algorithms for Scientific Computing - William Severa: 2016 International Conference on Rebooting Computing
Innovative Transmission Line Measurement and Characterization Reduce Time to Repair for Complex Communication Systems: MicroApps 2015 - Keysight Technologies
IMS Organizer: Richard Snyder, President Elect for MTT-S
Inspiring Brilliance: Maxwell, field theory and the road to relativity and quantum theory
IMS Organizers: Samir El-Ghazaly, President of MTT-S on Society Mission and Structure
IEEE Themes - Efficient networking services underpin social networks
David Forney - IEEE Medal of Honor 2016
Experimental Insights from the Rogues Gallery Testbed - Jeffrey Young - ICRC San Mateo, 2019
Brooklyn 5G Summit 2014: Dr. Robert Heath on Coverage and Capacity Analysis of Dense Millimeter Wave Cellular System
G. David Forney, Jr. accepts the IEEE Medal of Honor - Honors Ceremony 2016
Complex Valued Neural Networks: Theory and Applications

IEEE-USA E-Books

  • IEE Colloquium on 'Circuit Theory and DSP' (Digest No.037)

    None

  • Abstract of 'Graph Theory and Electric Networks II'

    None

  • Random Networks

    This chapter contains sections titled:Generation of Random NetworksDegree Distribution of Random NetworksEntropy of Random NetworksProperties of Random NetworksWeak Ties in Random NetworksRandomization of Regular NetworksAnalysisExercises

  • IEE Colloquium on 'Bond Graphs in Control' (Digest No.063)

    None

  • Graphs

    This chapter contains sections titled:Set‐Theoretic Definition of a GraphMatrix Algebra Definition of a GraphThe Bridges of Königsberg GraphSpectral Properties of GraphsTypes of GraphsTopological StructureGraphs in SoftwareExercises

  • PRUNER: algorithms for finding monad patterns in DNA sequences

    We present new algorithms for discovering monad patterns in DNA sequences. Monad patterns are of the form (l,d)-k, where l is the length of the pattern, d is the maximum number of mismatches allowed, and k is the minimum number of times the pattern is repeated in the given sample. The time-complexity of some of the best known algorithms to date is O(nt/sup 2/l/sup d/|/spl Sigma/|/sup d/2/), where t is the number of input sequences, and n is the length of each input sequence. The first algorithm that we present takes O(n/sup 2/t/sup 2/l/sup d/2/|/spl Sigma/|/sup d/2/) and space O(ntl/sup d/2/|/spl Sigma/|/sup d/2/), and the second algorithm takes O(n/sup 3/t/sup 3/l/sup d/2/|/spl Sigma/|/sup d/2/ time using O(l/sup d/2/|/spl Sigma/|/sup d/2/) space. In practice, our algorithms have much better performance provided the d/l ratio is small.

  • A matrix approach to list coloring problems

    This paper investigates the list coloring problem, and presents a number of new results and algorithms. By using the matrix semi-tensor product, the list coloring problem is studied, and three necessary and sufficient conditions are proposed, based on which an algorithm is designed to find all the list coloring schemes for any simple graph. In addition, the effectiveness of the results/algorithms presented in this paper is shown by one illustrative example.

  • A new proof of the colored branch Theorem

    The colored branch theorem is a result from graph theory that has been described first by Minty. It states the existence of certain meshes and cuts in a graph, whose edges are colored red, green and blue, respectively. The theorem, sometimes also referred to as the lemma of the colored arcs, can be utilized to give short and elegant proofs of many other theorems in graph and circuit theory and has therefore turned out to be of vital importance. We present a new set theoretic proof of the colored branch theorem, that reveals its relationship to the orthogonality theorem, another well-known fundamental result about meshes and cuts in a graph.

  • A DNA Encoding Method to Determine and Sequence All Cliques in a Weighted Graph

    In many aspects of advanced applied information technology, science, and bioinformatics, having theoretical concepts based on graph theory provides an important way to create or develop new hybrids, combined information, and intelligent techniques or methods. Finding the maximum weighted clique problem can be a significant issue and concept in graph theory. Meanwhile, encoding biological codes, represented as biological sequence information, is an important process in executing biological computations. In this paper, we focus on a way of encoding biological sequences to create a new encoding method particularly designed to solve clique problems in a weighted graph.

  • Re-ranking of image search results using a graph algorithm

    Although one of the most common usages of Internet is searching, especially in image search, the users are not satisfied due to many irrelevant results. In this paper we present a method to identify irrelevant results of image search on the Internet and re-rank the results so that the relevant results will have a higher priority within the list. The proposed method represents the similarity of images in a graph structure, and then finds the densest component in the graph representing the most similar set of images corresponding to the query.