Relevant bibliographies by topics / Algorithms. Graph theory

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Algorithms. Graph theory'

Author: Grafiati
Published: 4 June 2021
Last updated: 16 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Algorithms. Graph theory.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Algorithms. Graph theory"

1

de Figueiredo, Celina M. H., and Jayme L. Szwarcfiter. "Graph theory and algorithms." Journal of the Brazilian Computer Society 18, no. 2 (2012): 83–84. http://dx.doi.org/10.1007/s13173-012-0068-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Li, Jonathan, Rohan Potru, and Farhad Shahrokhi. "A Performance Study of Some Approximation Algorithms for Computing a Small Dominating Set in a Graph." Algorithms 13, no. 12 (2020): 339. http://dx.doi.org/10.3390/a13120339.

Full text
Abstract:
We implement and test the performances of several approximation algorithms for computing the minimum dominating set of a graph. These algorithms are the standard greedy algorithm, the recent Linear programming (LP) rounding algorithms and a hybrid algorithm that we design by combining the greedy and LP rounding algorithms. Over the range of test data, all algorithms perform better than anticipated in theory, and have small performance ratios, measured as the size of output divided by the LP objective lower bound. However, each have advantages over the others. For instance, LP rounding algorith
APA, Harvard, Vancouver, ISO, and other styles
3

Danilov, I. G., and S. I. Rodzin. "Distributed implementation of the graphs clusterization goodness metrics calculation using mapreduce and vertex-oriented graph processing model." Informatization and communication, no. 3 (May 5, 2020): 31–35. http://dx.doi.org/10.34219/2078-8320-2020-11-3-31-35.

Full text
Abstract:
Goal. Research of the implementation features of the graph clusterization goodness metrics using the vertexoriented graph computing model and MapReduce. Materials and methods. The basic concepts of graph theory were used to define the goodness metrics, and the MapReduce with a vertex-oriented graph-computational approach were used to develop the goodness metrics calculation algorithms. Results. Distributed algorithms for calculating graph clustering goodness metrics are proposed and tested. Conclusion. The results can be used to analyze the quality of the partitioning of large graphs that obta
APA, Harvard, Vancouver, ISO, and other styles
4

Fava, Leandro, João Furtado, Gilson Helfer, et al. "A Multi-Start Algorithm for Solving the Capacitated Vehicle Routing Problem with Two-Dimensional Loading Constraints." Symmetry 13, no. 9 (2021): 1697. http://dx.doi.org/10.3390/sym13091697.

Full text
Abstract:
This work presents a multistart algorithm for solving the capacitated vehicle routing problem with 2D loading constraints (2L-CVRP) allowing for the rotation of goods. Research dedicated to graph theory and symmetry considered the vehicle routing problem as a classical application. This problem has complex aspects that stimulate the use of advanced algorithms and symmetry in graphs. The use of graph modeling of the 2L-CVRP problem by undirected graph allowed the high performance of the algorithm. The developed algorithm is based on metaheuristics, such as the Constructive Genetic Algorithm (CG
APA, Harvard, Vancouver, ISO, and other styles
5

Shiau, S. Y., R. Joynt, and S. N. Coppersmith. "Physically-motivated dynamical algorithms for the graph isomorphism problem." Quantum Information and Computation 5, no. 6 (2005): 492–506. http://dx.doi.org/10.26421/qic5.6-7.

Full text
Abstract:
The graph isomorphism problem (GI) plays a central role in the theory of computational complexity and has importance in physics and chemistry as well \cite{kobler93,fortin96}. No polynomial-time algorithm for solving GI is known. We investigate classical and quantum physics-based polynomial-time algorithms for solving the graph isomorphism problem in which the graph structure is reflected in the behavior of a dynamical system. We show that a classical dynamical algorithm proposed by Gudkov and Nussinov \cite{gudkov02} as well as its simplest quantum generalization fail to distinguish pairs of
APA, Harvard, Vancouver, ISO, and other styles
6

Coufal, Petr, Štěpán Hubálovský, and Marie Hubálovská. "Application of Basic Graph Theory in Autonomous Motion of Robots." Mathematics 9, no. 9 (2021): 919. http://dx.doi.org/10.3390/math9090919.

Full text
Abstract:
Discrete mathematics covers the field of graph theory, which solves various problems in graphs using algorithms, such as coloring graphs. Part of graph theory is focused on algorithms that solve the passage through mazes and labyrinths. This paper presents a study conducted as part of a university course focused on graph theory. The course addressed the problem of high student failure in the mazes and labyrinths chapter. Students’ theoretical knowledge and practical skills in solving algorithms in the maze were low. Therefore, the use of educational robots and their involvement in the teaching
APA, Harvard, Vancouver, ISO, and other styles
7

Rautiainen, Mikko, Veli Mäkinen, and Tobias Marschall. "Bit-parallel sequence-to-graph alignment." Bioinformatics 35, no. 19 (2019): 3599–607. http://dx.doi.org/10.1093/bioinformatics/btz162.

Full text
Abstract:
Abstract Motivation Graphs are commonly used to represent sets of sequences. Either edges or nodes can be labeled by sequences, so that each path in the graph spells a concatenated sequence. Examples include graphs to represent genome assemblies, such as string graphs and de Bruijn graphs, and graphs to represent a pan-genome and hence the genetic variation present in a population. Being able to align sequencing reads to such graphs is a key step for many analyses and its applications include genome assembly, read error correction and variant calling with respect to a variation graph. Results
APA, Harvard, Vancouver, ISO, and other styles
8

Talmaciu, Mihai, and Elena Nechita. "On Polar, Trivially Perfect Graphs." International Journal of Computers Communications & Control 5, no. 5 (2010): 939. http://dx.doi.org/10.15837/ijccc.2010.5.2257.

Full text
Abstract:
<p>During the last decades, different types of decompositions have been processed in the field of graph theory. In various problems, for example in the construction of recognition algorithms, frequently appears the so-called weakly decomposition of graphs.<br />Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. Recognizing a polar graph is known to be NP-complete. For this class of graphs, polynomial algorithms for the maximum stable set problem are unknown and algorithms for the dominating set pro
APA, Harvard, Vancouver, ISO, and other styles
9

Chang, Xian, Jordan Eizenga, Adam M. Novak, Jouni Sirén, and Benedict Paten. "Distance indexing and seed clustering in sequence graphs." Bioinformatics 36, Supplement_1 (2020): i146—i153. http://dx.doi.org/10.1093/bioinformatics/btaa446.

Full text
Abstract:
Abstract Motivation Graph representations of genomes are capable of expressing more genetic variation and can therefore better represent a population than standard linear genomes. However, due to the greater complexity of genome graphs relative to linear genomes, some functions that are trivial on linear genomes become much more difficult in genome graphs. Calculating distance is one such function that is simple in a linear genome but complicated in a graph context. In read mapping algorithms such distance calculations are fundamental to determining if seed alignments could belong to the same
APA, Harvard, Vancouver, ISO, and other styles
10

Beaufays, Françoise, and Eric A. Wan. "Relating Real-Time Backpropagation and Backpropagation-Through-Time: An Application of Flow Graph Interreciprocity." Neural Computation 6, no. 2 (1994): 296–306. http://dx.doi.org/10.1162/neco.1994.6.2.296.

Full text
Abstract:
We show that signal flow graph theory provides a simple way to relate two popular algorithms used for adapting dynamic neural networks, real-time backpropagation and backpropagation-through-time. Starting with the flow graph for real-time backpropagation, we use a simple transposition to produce a second graph. The new graph is shown to be interreciprocal with the original and to correspond to the backpropagation-through-time algorithm. Interreciprocity provides a theoretical argument to verify that both flow graphs implement the same overall weight update.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Algorithms. Graph theory"

1

Bessy, Stéphane. "Some problems in graph theory and graphs algorithmic theory." Habilitation à diriger des recherches, Université Montpellier II - Sciences et Techniques du Languedoc, 2012. http://tel.archives-ouvertes.fr/tel-00806716.

Full text
Abstract:
This document is a long abstract of my research work, concerning graph theory and algorithms on graphs. It summarizes some results, gives ideas of the proof for some of them and presents the context of the different topics together with some interesting open questions connected to them The first part precises the notations used in the rest of the paper; the second part deals with some problems on cycles in digraphs; the third part is an overview of two graph coloring problems and one problem on structures in colored graphs; finally the fourth part focus on some results in algorithmic graph the
APA, Harvard, Vancouver, ISO, and other styles
2

Anderson, Jon K. "Genetic algorithms applied to graph theory." Virtual Press, 1999. http://liblink.bsu.edu/uhtbin/catkey/1136714.

Full text
Abstract:
This thesis proposes two new variations on the genetic algorithm. The first attempts to improve clustering problems by optimizing the structure of a genetic string dynamically during the run of the algorithm. This is done by using a permutation on the allele which is inherited by the next generation. The second is a multiple pool technique which ensures continuing convergence by maintaining unique lineages and merging pools of similar age. These variations will be tested against two well-known graph theory problems, the Traveling Salesman Problem and the Maximum Clique Problem. The results wil
APA, Harvard, Vancouver, ISO, and other styles
3

Ren, Chenghui, and 任成會. "Algorithms for evolving graph analysis." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2014. http://hdl.handle.net/10722/197105.

Full text
Abstract:
In many applications, entities and their relationships are represented by graphs. Examples include social networks (users and friendship), the WWW (web pages and hyperlinks) and bibliographic networks (authors and co-authorship). In a dynamic world, information changes and so the graphs representing the information evolve with time. For example, a Facebook link between two friends is established, or a hyperlink is added to a web page. We propose that historical graph-structured data be archived for analytical processing. We call a historical evolving graph sequence an EGS. We study the pro
APA, Harvard, Vancouver, ISO, and other styles
4

Holloway, Nick. "Parallel algorithms in graph theory and algebra." Thesis, University of Warwick, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.338724.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Soleimanfallah, Arezou. "Fixed-parameter tractable algorithms in graph theory." Thesis, Royal Holloway, University of London, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.531326.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Deel, Troy A. "A statistical study of graph algorithms." Virtual Press, 1985. http://liblink.bsu.edu/uhtbin/catkey/424871.

Full text
Abstract:
The object of this paper is to investigate the behavior of some important graph properties and to statistically analyze the execution times of certain graph are the average degree of a vertex, connectivity of a graph, the existence of Hamilton cycles, Euler tours, and bipartitions in graphs. This study is unique in that it is based on statistical rather than deterministic methods.
APA, Harvard, Vancouver, ISO, and other styles
7

Hegde, Rajneesh. "New Tools and Results in Graph Structure Theory." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/10481.

Full text
Abstract:
We first prove a ``non-embeddable extensions' theorem for polyhedral graph embeddings. Let G be a ``weakly 4-connected' planar graph. We describe a set of constructions that produce a finite list of non-planar graphs, each having a minor isomorphic to G, such that every non-planar weakly 4-connected graph H that has a minor isomorphic to G has a minor isomorphic to one of the graphs in the list. The theorem is more general and applies in particular to polyhedral embeddings in any surface. We discuss an approach to proving Jorgensen's conjecture, which states that if G is a 6-connected graph w
APA, Harvard, Vancouver, ISO, and other styles
8

Peng, Richard. "Algorithm Design Using Spectral Graph Theory." Research Showcase @ CMU, 2013. http://repository.cmu.edu/dissertations/277.

Full text
Abstract:
Spectral graph theory is the interplay between linear algebra and combinatorial graph theory. Laplace’s equation and its discrete form, the Laplacian matrix, appear ubiquitously in mathematical physics. Due to the recent discovery of very fast solvers for these equations, they are also becoming increasingly useful in combinatorial optimization, computer vision, computer graphics, and machine learning. In this thesis, we develop highly efficient and parallelizable algorithms for solving linear systems involving graph Laplacian matrices. These solvers can also be extended to symmetric diagonally
APA, Harvard, Vancouver, ISO, and other styles
9

Lee, William W. L. (William Wai Lam) Carleton University Dissertation Computer Science. "Tree editing algorithms." Ottawa, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Warty, Durgesh A. "Development of Graphcards a hypertext system for learning graph theory and graph algorithms." Virtual Press, 1998. http://liblink.bsu.edu/uhtbin/catkey/1101590.

Full text
Abstract:
GraphCards is a research project devoted to the development of a system for learning graph theory and implementing graph algorithms. It contains an information base for learning and referencing graph theory topics, integrated with an experimentation tool set to create and manipulate graphs. Due to the non-linear relationship of the information, its organization is hypertext based. The hypertext system NoteCards 1 is used to develop the application.The contribution of the current project is to complete and improve an existing system by reclassifying and rewriting the textual information into di
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Algorithms. Graph theory"

1

Algorithmic graph theory. Cambridge University Press, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Golumbic, Martin Charles, and Irith Ben-Arroyo Hartman, eds. Graph Theory, Combinatorics and Algorithms. Springer-Verlag, 2005. http://dx.doi.org/10.1007/b106672.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

International Conference on the Theory and Applications of Graphs (7th 1992 Western Michigan University). Graph theory, combinatorics, and algorithms. Wiley, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

S, Swamy M. N., ed. Graphs: Theory and algorithms. Wiley, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Nishizeki, T. Planar graphs: Theory and algorithms. North-Holland, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

N, Chiba, ed. Planar graphs: Theory and algorithms. Dover Publications, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Agnarsson, Geir. Graph theory: Modeling, applications, and algorithms. Pearson/Prentice Hall, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Algorithms on graphs. TAB Professional and Reference Books, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

1957-, Gutin Gregory, ed. Digraphs: Theory, algorithms, and applications. 2nd ed. Springer, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

1957-, Gutin Gregory, ed. Digraphs: Theory, algorithms, and applications. Springer, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Algorithms. Graph theory"

1

Jungnickel, Dieter. "Basic Graph Theory." In Graphs, Networks and Algorithms. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-32278-5_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Jungnickel, Dieter. "Basic Graph Theory." In Graphs, Networks and Algorithms. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-662-03822-2_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Recski, András. "Basic concepts from graph theory." In Algorithms and Combinatorics. Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-662-22143-3_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Faudree, R. J., C. C. Rousseau, and R. H. Schelp. "Problems in Graph Theory from Memphis." In Algorithms and Combinatorics. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-60406-5_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kasyanov, Victor N., and Viadimir A. Evstigneev. "Computational Models. Complexity and Fundamental Algorithms." In Graph Theory for Programmers. Springer Netherlands, 2000. http://dx.doi.org/10.1007/978-94-011-4122-2_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Thorup, Mikkel, and David R. Karger. "Dynamic Graph Algorithms with Applications." In Algorithm Theory - SWAT 2000. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44985-x_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Fomin, Fedor V., Pinar Heggernes, and Dieter Kratsch. "Exact Algorithms for Graph Homomorphisms." In Fundamentals of Computation Theory. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11537311_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sridharan, Sriraman, and R. Balakrishnan. "Introduction to Graph Theory." In Foundations of Discrete Mathematics with Algorithms and Programming. Chapman and Hall/CRC, 2018. http://dx.doi.org/10.1201/9781351019149-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Simonovits, Miklós. "Paul Erdős’ Influence on Extremal Graph Theory." In Algorithms and Combinatorics. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-60406-5_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Saha Ray, Santanu. "Algorithms on Graphs." In Graph Theory with Algorithms and its Applications. Springer India, 2012. http://dx.doi.org/10.1007/978-81-322-0750-4_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Algorithms. Graph theory"

1

Navrotskaya, Anna, and Victor Il’ev. "A local search for a graph clustering problem." In NUMERICAL COMPUTATIONS: THEORY AND ALGORITHMS (NUMTA–2016): Proceedings of the 2nd International Conference “Numerical Computations: Theory and Algorithms”. Author(s), 2016. http://dx.doi.org/10.1063/1.4965325.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Palasthy, Hedviga, Janka Majherova, and Igor Cernak. "Visualization of selected algorithms of graph theory." In 2012 International Conference on e-Learning and e-Technologies in Education (ICEEE). IEEE, 2012. http://dx.doi.org/10.1109/icelete.2012.6333389.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Andoni, Alexandr, Aleksandar Nikolov, Krzysztof Onak, and Grigory Yaroslavtsev. "Parallel algorithms for geometric graph problems." In STOC '14: Symposium on Theory of Computing. ACM, 2014. http://dx.doi.org/10.1145/2591796.2591805.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Grohe, Martin, Ken-ichi Kawarabayashi, and Bruce Reed. "A Simple Algorithm for the Graph Minor Decomposition − Logic meets Structural Graph Theory–." In Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2013. http://dx.doi.org/10.1137/1.9781611973105.30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Tan, Yong. "Analyzing traffic problem model with graph theory algorithms." In 2015 Science and Information Conference (SAI). IEEE, 2015. http://dx.doi.org/10.1109/sai.2015.7237137.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Xu, Qianfang, and Jun Guo. "Alarm Association Algorithms Based on Spectral Graph Theory." In 2009 International Joint Conference on Artificial Intelligence (JCAI). IEEE, 2009. http://dx.doi.org/10.1109/jcai.2009.187.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bucknor, Norman K. "Automatic Determination of Transmission Powerflow Mechanizability Using Graph Theory." In ASME 2007 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/detc2007-34018.

Full text
Abstract:
A methodology has been developed to automatically generate planetary geartrain topologies based on criteria such as the number of desired speed ratios and the number of torque transmitting mechanisms [1]. This paper describes an algorithm and computer code for automatically determining the mechanizability of the candidate geartrains. The mathematical description of each topology is interpreted as a graph, a collection of vertices and connecting edges, which can then be tested for planarity using graph-processing algorithms. A planar graph implies mechanizability. Using another algorithm based
APA, Harvard, Vancouver, ISO, and other styles
8

Yang, Qiaoyan, and Qinghong Zeng. "Application of Genetic Algorithms in Graph Theory and Optimization." In 2016 3rd International Conference on Materials Engineering, Manufacturing Technology and Control. Atlantis Press, 2016. http://dx.doi.org/10.2991/icmemtc-16.2016.6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Spielman, Daniel A. "Algorithms, Graph Theory, and Linear Equations in Laplacian Matrices." In Proceedings of the International Congress of Mathematicians 2010 (ICM 2010). Published by Hindustan Book Agency (HBA), India. WSPC Distribute for All Markets Except in India, 2011. http://dx.doi.org/10.1142/9789814324359_0164.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Cuzzocrea, Alfredo, and Paolo Serafino. "A family of graph-theory-driven algorithms for managing complex probabilistic graph data efficiently." In the 15th Symposium. ACM Press, 2011. http://dx.doi.org/10.1145/2076623.2076657.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Algorithms. Graph theory"

1

Thomas, Robin. Graph Minors: Structure Theory and Algorithms. Defense Technical Information Center, 1993. http://dx.doi.org/10.21236/ada271851.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

GEORGIA INST OF TECH ATLANTA. Graph Minors: Structure Theory and Algorithms. Defense Technical Information Center, 1993. http://dx.doi.org/10.21236/ada266033.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Algorithms. Graph theory' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography