Hochschulschrift
On the complexity of isomorphism testing for restricted classes of graphs
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Ulm, Univ., Diss., 2010
- Schlagwort
-
Graphenisomorphie
- Urheber
- URN
-
urn:nbn:de:bsz:289-vts-72643
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:43 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Hochschulschrift
Beteiligte
Ähnliche Objekte (12)
On the complexity of isomorphism testing for restricted classes of graphs
Complexity-restricted advice functions
Computational complexity of graph polynomials
Testing for restricted stochastic dominance
Testing for restricted stochastic dominance
Quantum complexity of graph and algebraic problems
Computational complexity aspects of implicit graph representations
The complexity of economic policy : restricted local optima in tax policy design
The complexity of economic policy: restricted local optima in tax policy design
Chemical complexity of odors increases reliability of olfactory threshold testing
The complexity of embedding graphs into binary trees
Geometric Representations of Graphs with Low Polygonal Complexity
On the complexity of isomorphism testing for restricted classes of graphs
Complexity-restricted advice functions
Computational complexity of graph polynomials
Testing for restricted stochastic dominance
Testing for restricted stochastic dominance
Quantum complexity of graph and algebraic problems
Computational complexity aspects of implicit graph representations
The complexity of economic policy : restricted local optima in tax policy design
The complexity of economic policy: restricted local optima in tax policy design
Chemical complexity of odors increases reliability of olfactory threshold testing
The complexity of embedding graphs into binary trees
Geometric Representations of Graphs with Low Polygonal Complexity
On the complexity of isomorphism testing for restricted classes of graphs
Complexity-restricted advice functions
Computational complexity of graph polynomials
Testing for restricted stochastic dominance
Testing for restricted stochastic dominance
Quantum complexity of graph and algebraic problems
Computational complexity aspects of implicit graph representations
The complexity of economic policy : restricted local optima in tax policy design
The complexity of economic policy: restricted local optima in tax policy design
Chemical complexity of odors increases reliability of olfactory threshold testing
The complexity of embedding graphs into binary trees