Log in

Relevant bibliographies by topics / Graph theory. Recursion theory

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Graph theory. Recursion 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 'Graph theory. Recursion 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 "Graph theory. Recursion theory"

1

Gasarch, William, and Jeffry L. Hirst. "Reverse Mathematics and Recursive Graph Theory." Mathematical Logic Quarterly 44, no. 4 (1998): 465–73. http://dx.doi.org/10.1002/malq.19980440405.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Hong, Kyungpyo, and Seungsang Oh. "Enumeration on graph mosaics." Journal of Knot Theory and Its Ramifications 26, no. 05 (2017): 1750032. http://dx.doi.org/10.1142/s0218216517500328.

Full text

Abstract:

Since the Jones polynomial was discovered, the connection between knot theory and quantum physics has been of great interest. Lomonaco and Kauffman introduced the knot mosaic system to give a definition of the quantum knot system that is intended to represent an actual physical quantum system. Recently the authors developed an algorithm producing the exact enumeration of knot mosaics, which uses a recursion formula of state matrices. As a sequel to this research program, we similarly define the (embedded) graph mosaic system by using 16 graph mosaic tiles, representing graph diagrams with vert

APA, Harvard, Vancouver, ISO, and other styles

3

Deng, Qingying, Xian’an Jin, and Louis H. Kauffman. "Graphical virtual links and a polynomial for signed cyclic graphs." Journal of Knot Theory and Its Ramifications 27, no. 10 (2018): 1850054. http://dx.doi.org/10.1142/s0218216518500542.

Full text

Abstract:

For a signed cyclic graph [Formula: see text], we can construct a unique virtual link [Formula: see text] by taking the medial construction and converting 4-valent vertices of the medial graph to crossings according to the signs. If a virtual link can occur in this way then we say that the virtual link is graphical. In this paper, we shall prove that a virtual link [Formula: see text] is graphical if and only if it is checkerboard colorable. On the other hand, we introduce a polynomial [Formula: see text] for signed cyclic graphs, which is defined via a deletion-marking recursion. We shall est

APA, Harvard, Vancouver, ISO, and other styles

4

Kierstead, H. A., S. G. Penrice, and W. T. Trotter. "On-Line Coloring and Recursive Graph Theory." SIAM Journal on Discrete Mathematics 7, no. 1 (1994): 72–89. http://dx.doi.org/10.1137/s0895480192224737.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

HAMANA, MAKOTO, KAZUTAKA MATSUDA, and KAZUYUKI ASADA. "The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics." Mathematical Structures in Computer Science 28, no. 2 (2016): 287–337. http://dx.doi.org/10.1017/s096012951600027x.

Full text

Abstract:

The aim of this paper is to provide mathematical foundations of a graph transformation language, called UnCAL, using categorical semantics of type theory and fixed points. About 20 years ago, Bunemanet al. developed a graph database query language UnQL on the top of a functional meta-language UnCAL for describing and manipulating graphs. Recently, the functional programming community has shown renewed interest in UnCAL, because it provides an efficient graph transformation language which is useful for various applications, such as bidirectional computation.In order to make UnCAL more flexible

APA, Harvard, Vancouver, ISO, and other styles

6

TRALDI, LORENZO. "A BRACKET POLYNOMIAL FOR GRAPHS, II: LINKS, EULER CIRCUITS AND MARKED GRAPHS." Journal of Knot Theory and Its Ramifications 19, no. 04 (2010): 547–86. http://dx.doi.org/10.1142/s0218216510007978.

Full text

Abstract:

Let D be an oriented classical or virtual link diagram with directed universe [Formula: see text]. Let C denote a set of directed Euler circuits, one in each connected component of U. There is then an associated looped interlacement graph [Formula: see text] whose construction involves very little geometric information about the way D is drawn in the plane; consequently [Formula: see text] is different from other combinatorial structures associated with classical link diagrams, like the checkerboard graph, which can be difficult to extend to arbitrary virtual links. [Formula: see text] is dete

APA, Harvard, Vancouver, ISO, and other styles

7

TRALDI, LORENZO. "A BRACKET POLYNOMIAL FOR GRAPHS, IV: UNDIRECTED EULER CIRCUITS, GRAPH-LINKS AND MULTIPLY MARKED GRAPHS." Journal of Knot Theory and Its Ramifications 20, no. 08 (2011): 1093–128. http://dx.doi.org/10.1142/s0218216511009157.

Full text

Abstract:

In earlier work we introduced the graph bracket polynomial of graphs with marked vertices, motivated by the fact that the Kauffman bracket of a link diagram D is determined by a looped, marked version of the interlacement graph associated to a directed Euler system of the universe graph of D. Here we extend the graph bracket to graphs whose vertices may carry different kinds of marks, and we show how multiply marked graphs encode interlacement with respect to arbitrary (undirected) Euler systems. The extended machinery brings together the earlier version and the graph-links of Ilyutko and Mant

APA, Harvard, Vancouver, ISO, and other styles

8

Hallouin, Emmanuel, and Marc Perret. "Recursive Towers of Curves over Finite Fields using Graph Theory." Moscow Mathematical Journal 14, no. 4 (2014): 773–806. http://dx.doi.org/10.17323/1609-4514-2014-14-4-773-806.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Durand, Arnaud, Neil D. Jones, Johann A. Makowsky, and Malika More. "Fifty years of the spectrum problem: survey and new results." Bulletin of Symbolic Logic 18, no. 4 (2012): 505–53. http://dx.doi.org/10.2178/bsl.1804020.

Full text

Abstract:

AbstractIn 1952, Heinrich Scholz published a question in The Journal of Symbolic Logic asking for a characterization of spectra, i.e., sets of natural numbers that are the cardinalities of finite models of first order sentences. Günter Asser in turn asked whether the complement of a spectrum is always a spectrum. These innocent questions turned out to be seminal for the development of finite model theory and descriptive complexity. In this paper we survey developments over the last 50-odd years pertaining to the spectrum problem. Our presentation follows conceptual developments rather than the

APA, Harvard, Vancouver, ISO, and other styles

10

SHENOY, PRAKASH P. "REPRESENTING CONDITIONAL INDEPENDENCE RELATIONS BY VALUATION NETWORKS." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 02, no. 02 (1994): 143–65. http://dx.doi.org/10.1142/s0218488594000134.

Full text

Abstract:

Valuation networks have been proposed as graphical representations of valuation-based systems. The axiomatic framework of valuation-based systems is able to capture many uncertainty calculi including probability theory, Dempster-Shafer's belief-function theory, Spohn's epistemic belief theory, and Zadeh's possibility theory. In this paper, we show how valuation networks encode conditional independence relations. For the probabilistic case, the class of probability models encoded by valuation networks includes undirected graph models, directed acyclic graph models, directed balloon graph models

APA, Harvard, Vancouver, ISO, and other styles

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

1

Hunt, D'Hania J. "Constructing higher-order de Bruijn graphs." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2002. http://library.nps.navy.mil/uhtbin/hyperion-image/02Jun%5FHunt.pdf.

Full text

Abstract:

Thesis (M.S. in Applied Mathematics)--Naval Postgraduate School, June 2002.<br>Thesis advisor(s): Harold Fredricksen, Craig W. Rasmussen. Includes bibliographical references (p. 45-46). Also available online.

APA, Harvard, Vancouver, ISO, and other styles

2

Burns, Jonathan. "Recursive Methods in Number Theory, Combinatorial Graph Theory, and Probability." Scholar Commons, 2014. https://scholarcommons.usf.edu/etd/5193.

Full text

Abstract:

Recursion is a fundamental tool of mathematics used to define, construct, and analyze mathematical objects. This work employs induction, sieving, inversion, and other recursive methods to solve a variety of problems in the areas of algebraic number theory, topological and combinatorial graph theory, and analytic probability and statistics. A common theme of recursively defined functions, weighted sums, and cross-referencing sequences arises in all three contexts, and supplemented by sieving methods, generating functions, asymptotics, and heuristic algorithms. In the area of number theory, this

APA, Harvard, Vancouver, ISO, and other styles

3

Favaro, Flavia Fernanda. "A teoria dos grafos e sua abordagem na sala de aula com recursos educacionais digitais /." Rio Claro, 2017. http://hdl.handle.net/11449/152457.

Full text

Abstract:

Orientador: Érika Capelato<br>Banca: Thiago de Melo<br>Banca: Camila Fernanda Bassetto<br>Resumo: Neste trabalho estudamos a Teoria dos Grafos compreendendo suas definições, resultados e algumas aplicações como O Problema das Pontes de Köningsberg, O Problema Chinês do Carteiro, O Problema do Caixeiro Viajante e O Teorema das Quatro e das Cinco Cores. Com o uso da Coleção M3 - Matemática Multimídia, que contém recursos educacionais em formatos digitais, aplicamos as atividades sugeridas aos alunos do segundo ano do Ensino Médio de uma escola particular localizado na cidade de São Pedro - SP. A

APA, Harvard, Vancouver, ISO, and other styles

4

Favaro, Flavia Fernanda [UNESP]. "A teoria dos grafos e sua abordagem na sala de aula com recursos educacionais digitais." Universidade Estadual Paulista (UNESP), 2017. http://hdl.handle.net/11449/152457.

Full text

Abstract:

Submitted by FLAVIA FERNANDA FAVARO null (flaviafavaro@hotmail.com) on 2018-01-10T03:14:21Z No. of bitstreams: 1 A Teoria dos Grafos e sua abordagem na sala de aula com recursos educacionais digitais.pdf: 2731904 bytes, checksum: 49a548fa505952226f589c5471f9b496 (MD5)<br>Approved for entry into archive by Adriana Aparecida Puerta null (dripuerta@rc.unesp.br) on 2018-01-10T18:21:25Z (GMT) No. of bitstreams: 1 favaro_ff_me_rcla.pdf: 2692020 bytes, checksum: c889310c873cab619e98b36f809e81c0 (MD5)<br>Made available in DSpace on 2018-01-10T18:21:25Z (GMT). No. of bitstreams: 1 favaro_ff_me_rcla

APA, Harvard, Vancouver, ISO, and other styles

5

Yalcin, Bayramoglu Neslihan. "Recursive Shortest Spanning Tree Algorithms For Image Segmentatiton." Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/2/12606219/index.pdf.

Full text

Abstract:

Image segmentation has an important role in image processing because it is a tool to obtain higher level object descriptions for further processing. In some applications such as large image databases or video image sequence segmentations, the speed of the segmentation algorithm may become a drawback of the application. This thesis work is a study to improve the run-time performance of a well-known segmentation algorithm, namely the Recursive Shortest Spanning Tree (RSST). Both the original and the fast RSST found in the literature are analyzed and a comparison is made between these techniques.

APA, Harvard, Vancouver, ISO, and other styles

6

Seetapun, David. "Contributions to recursion theory." Thesis, University of Cambridge, 1991. https://www.repository.cam.ac.uk/handle/1810/251510.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Marcus, Sherry Elizabeth 1966. "Contributions to higher recursion theory." Thesis, Massachusetts Institute of Technology, 1993. http://hdl.handle.net/1721.1/28018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Emerson, Guy Edward Toh. "Functional distributional semantics : learning linguistically informed representations from a precisely annotated corpus." Thesis, University of Cambridge, 2018. https://www.repository.cam.ac.uk/handle/1810/284882.

Full text

Abstract:

The aim of distributional semantics is to design computational techniques that can automatically learn the meanings of words from a body of text. The twin challenges are: how do we represent meaning, and how do we learn these representations? The current state of the art is to represent meanings as vectors - but vectors do not correspond to any traditional notion of meaning. In particular, there is no way to talk about 'truth', a crucial concept in logic and formal semantics. In this thesis, I develop a framework for distributional semantics which answers this challenge. The meaning of a word

APA, Harvard, Vancouver, ISO, and other styles

9

Gloor, Oliver Gloor Oliver Patrik Andreas. "Galois theory for combinatory algebras and its application to recursion theory /." [S.l.] : [s.n.], 1995. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=11095.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Zuppiroli, Sara <1979&gt. "Probabilistic Recursion Theory and Implicit Computational Complexity." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2014. http://amsdottorato.unibo.it/6723/.

Full text

Abstract:

In this thesis we provide a characterization of probabilistic computation in itself, from a recursion-theoretical perspective, without reducing it to deterministic computation. More specifically, we show that probabilistic computable functions, i.e., those functions which are computed by Probabilistic Turing Machines (PTM), can be characterized by a natural generalization of Kleene's partial recursive functions which includes, among initial functions, one that returns identity or successor with probability 1/2. We then prove the equi-expressivity of the obtained algebra and the class

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Graph theory. Recursion theory"

1

Gasarch, William I. Bounded queries in recursion theory. Birkauser, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Yao, Qing. Directed acyclic graphs, linear recursive regression, and inference about causal ordering. University of Toronto, Dept. of Statistics, 1993.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Recursion theory. A.K. Peters, 2001.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Shoenfield, Joseph R. Recursion Theory. Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/978-3-662-22378-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Nerode, Anil, and Richard Shore, eds. Recursion Theory. American Mathematical Society, 1985. http://dx.doi.org/10.1090/pspum/042.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Recursion theory. Springer-Verlag, 1993.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Sacks, Gerald E. Higher recursion theory. Springer-Verlag, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

L, Ivanov L. Algebraic recursion theory. E. Horwood, 1986.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Sacks, Gerald E. Higher Recursion Theory. Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/978-3-662-12013-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Ambos-Spies, Klaus, Gert H. Müller, and Gerald E. Sacks, eds. Recursion Theory Week. Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/bfb0086109.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Graph theory. Recursion theory"

1

Ahlswede, R., N. Cai, and Z. Zhang. "A Recursive Bound for the Number of Complete K-Subgraphs of a Graph." In Topics in Combinatorics and Graph Theory. Physica-Verlag HD, 1990. http://dx.doi.org/10.1007/978-3-642-46908-4_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Homer, Steve. "Admissible Recursion Theory." In Recursion Theory and Computational Complexity. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11072-6_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Moschovakis, Yiannis. "The recursion theorem." In Descriptive Set Theory. American Mathematical Society, 2009. http://dx.doi.org/10.1090/surv/155/08.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Kirwan, Brock, and Ty Bodily. "Graph Theory." In Encyclopedia of Clinical Neuropsychology. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-57111-9_9069.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Sucar, Luis Enrique. "Graph Theory." In Probabilistic Graphical Models. Springer London, 2015. http://dx.doi.org/10.1007/978-1-4471-6699-3_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Proth, J. M., and H. P. Hillion. "Graph Theory." In Mathematical Tools in Production Management. Springer US, 1990. http://dx.doi.org/10.1007/978-1-4615-9558-8_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Soberón, Pablo. "Graph Theory." In Problem-Solving Methods in Combinatorics. Springer Basel, 2013. http://dx.doi.org/10.1007/978-3-0348-0597-1_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Shier, Douglas R. "Graph Theory." In Encyclopedia of Operations Research and Management Science. Springer US, 2013. http://dx.doi.org/10.1007/978-1-4419-1153-7_402.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

O’Regan, Gerard. "Graph Theory." In Undergraduate Topics in Computer Science. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-34209-8_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Fagnani, Fabio, and Paolo Frasca. "Graph Theory." In Introduction to Averaging Dynamics over Networks. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-68022-4_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Graph theory. Recursion theory"

1

Tsai, Lung-Wen, Dar-Zen Chen, and Ta-Wei Lin. "Dynamic Analysis of Geared Robotic Mechanisms Using Graph Theory." In ASME 1996 Design Engineering Technical Conferences and Computers in Engineering Conference. American Society of Mechanical Engineers, 1996. http://dx.doi.org/10.1115/96-detc/mech-1554.

Full text

Abstract:

Abstract A systematic methodology is developed for the dynamic analysis of a class of geared robotic mechanisms. The concepts of canonical graph representation, the equivalent open-loop chain, and the mechanical transmission lines of a mechanism are used to organize the analysis. The approach modifies the Newton-Euler recursive inverse dynamics algorithm for open-loop chains and tree structures to include gear joints. A recursive method for the evaluation of reaction forces is developed. It is shown that reaction forces can be efficiently computed from the highest level primary links followed

APA, Harvard, Vancouver, ISO, and other styles

2

Jacob-Rao, Rohan, Andrew Cave, and Brigitte Pientka. "Mechanizing Proofs about Mendler-style Recursion." In LFMTP '16: Theory and Practice. ACM, 2016. http://dx.doi.org/10.1145/2966268.2966269.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Freeman, Jason. "Graph theory." In ACM SIGGRAPH 2008 art gallery. ACM Press, 2008. http://dx.doi.org/10.1145/1400385.1400449.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Freeman, Jason. "Graph theory." In the 6th ACM SIGCHI conference. ACM Press, 2007. http://dx.doi.org/10.1145/1254960.1254998.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Freeman, Jason. "Graph theory." In the 7th international conference. ACM Press, 2007. http://dx.doi.org/10.1145/1279740.1279794.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Mamouras, Konstantinos. "On the Hoare theory of monadic recursion schemes." In CSL-LICS '14: JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC. ACM, 2014. http://dx.doi.org/10.1145/2603088.2603157.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

THOMASSEN, CARSTEN. "CHROMATIC GRAPH THEORY." In Proceedings of the International Conference on Fundamental Sciences: Mathematics and Theoretical Physics. WORLD SCIENTIFIC, 2001. http://dx.doi.org/10.1142/9789812811264_0008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Møgelberg, Rasmus Ejlers. "A type theory for productive coprogramming via guarded recursion." In CSL-LICS '14: JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC. ACM, 2014. http://dx.doi.org/10.1145/2603088.2603132.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Loukanova, Roussanka. "Algorithmic Eta-reduction in Type-theory of Acyclic Recursion." In 12th International Conference on Agents and Artificial Intelligence. SCITEPRESS - Science and Technology Publications, 2020. http://dx.doi.org/10.5220/0009182410031010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Kosower, David A., and Nicola Adriano Lo Presti. "Recursion relations for integral coefficients." In 13th International Symposium on Radiative Corrections (Applications of Quantum Field Theory to Phenomenology). Sissa Medialab, 2018. http://dx.doi.org/10.22323/1.290.0005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Graph theory. Recursion theory"

1

Burch, Kimberly Jordan. Chemical Graph Theory. The MAA Mathematical Sciences Digital Library, 2008. http://dx.doi.org/10.4169/loci002857.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

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

3

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

4

Obert, James, Sean D. Turner, and Jason Hamlet. Graph Theory and IC Component Design Analysis. Office of Scientific and Technical Information (OSTI), 2020. http://dx.doi.org/10.2172/1606298.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Sweeney, Matthew, and Emily Shinkle. Understanding Discrete Fracture Networks Through Spectral Graph Theory. Office of Scientific and Technical Information (OSTI), 2021. http://dx.doi.org/10.2172/1812641.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Sweeney, Matthew, and Emily Shinkle. Understanding Discrete Fracture Networks Through Spectral Graph Theory. Office of Scientific and Technical Information (OSTI), 2021. http://dx.doi.org/10.2172/1812622.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Horan, Victoria, and Michael Gudaitis. Investigation of Zero Knowledge Proof Approaches Based on Graph Theory. Defense Technical Information Center, 2011. http://dx.doi.org/10.21236/ada540835.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Martin, S. P. The graph representation approach to topological field theory in 2 + 1 dimensions. Office of Scientific and Technical Information (OSTI), 1991. http://dx.doi.org/10.2172/5812219.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Martin, S. P. The graph representation approach to topological field theory in 2 + 1 dimensions. Office of Scientific and Technical Information (OSTI), 1991. http://dx.doi.org/10.2172/10127500.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Mesbahi, Mehran. Dynamic Security and Robustness of Networked Systems: Random Graphs, Algebraic Graph Theory, and Control over Networks. Defense Technical Information Center, 2012. http://dx.doi.org/10.21236/ada567125.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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!