Hochschulschrift
Full and partial Jacobian computation via graph coloring : algorithms and applications
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Gedr. Ausg. unter ISBN 978-3-9540410-1-5 ersch.
Aachen, Techn. Hochsch., Diss., 2012
- Classification
-
Mathematik
- Keyword
-
Graphfärbung , Bipartiter Graph , Kartesisches Gitter , Kombinatorische Optimierung , Funktionalmatrix , Schwach besetzte Matrix , Lineares Gleichungssystem , Präkonditionierung , Unvollständige Dreieckszerlegung
- Event
-
Veröffentlichung
- (where)
-
Aachen
- (who)
-
Hochschulbibliothek der Rheinisch-Westfälischen Technischen Hochschule Aachen
- (when)
-
2012
- Creator
- URN
-
urn:nbn:de:hbz:82-opus-41124
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:23 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Object type
- Hochschulschrift
Associated
- Lülfesmann, Michael
- Hochschulbibliothek der Rheinisch-Westfälischen Technischen Hochschule Aachen
Time of origin
- 2012
Other Objects (12)
Full and partial Jacobian computation via graph coloring : algorithms and applications
Improved distributed fractional coloring algorithms
Approximation and online algorithms in scheduling and coloring
Approximation algorithms for the interval constrained coloring problem
Exponential-Time Quantum Algorithms for Graph Coloring Problems
Approximation and online algorithms in scheduling and coloring
Algorithms for interval coloring, geometric packing and memory optimization
Parameterized and Approximation Algorithms for the Load Coloring Problem
Coloring Graphs in Oriented Coloring of Cubic Graphs
Algorithms and computation, Pt. 2
Algorithms and computation with Reduce
Algorithms and computation, Pt. 1
Full and partial Jacobian computation via graph coloring : algorithms and applications
Improved distributed fractional coloring algorithms
Approximation and online algorithms in scheduling and coloring
Approximation algorithms for the interval constrained coloring problem
Exponential-Time Quantum Algorithms for Graph Coloring Problems
Approximation and online algorithms in scheduling and coloring
Algorithms for interval coloring, geometric packing and memory optimization
Parameterized and Approximation Algorithms for the Load Coloring Problem
Coloring Graphs in Oriented Coloring of Cubic Graphs
Algorithms and computation, Pt. 2
Algorithms and computation with Reduce
Algorithms and computation, Pt. 1
Full and partial Jacobian computation via graph coloring : algorithms and applications
Improved distributed fractional coloring algorithms
Approximation and online algorithms in scheduling and coloring
Approximation algorithms for the interval constrained coloring problem
Exponential-Time Quantum Algorithms for Graph Coloring Problems
Approximation and online algorithms in scheduling and coloring
Algorithms for interval coloring, geometric packing and memory optimization
Parameterized and Approximation Algorithms for the Load Coloring Problem
Coloring Graphs in Oriented Coloring of Cubic Graphs
Algorithms and computation, Pt. 2
Algorithms and computation with Reduce