- Sprache
-
Englisch
- Identifier
-
1077698631
- Reihe
-
Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg; 2009-06
Beteiligte Personen und Organisationen
Kammer, Frank
Tholey, Torsten
Voepel, Heiko
Tholey, Torsten
Voepel, Heiko
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
26.01.2023, 13:55 MEZ
Objekttyp
- Monografie
Beteiligte
- Kammer, Frank
- Tholey, Torsten
- Voepel, Heiko
Ähnliche Objekte (12)
A lower bound for the treewidth of k-outerplanar graphs
Improved Algorithms for the 2-Vertex Disjoint Paths Problem
Finding Disjoint Paths on Directed Acyclic Graphs
Declarative Graph Algorithms via Knuth-Bendix Completion
Case studies for the derivation of pointer algorithms
Evaluation of Index-Based Skyline Algorithms
Failure-Sensitive Specification: A formal method for finding failure modes
Safety Optimization: A combination of fault tree analysis and optimization techniques
Embedding CTL* in an Extension to Interval Temporal Logic (ITL)
Improved Decomposition of Signal Transition Graphs
Greedy-Like Algorithms in Kleene Algebra
Layered Graph Traversals and Hamiltonian Path Problems - An Algebraic Approach
A lower bound for the treewidth of k-outerplanar graphs
Improved Algorithms for the 2-Vertex Disjoint Paths Problem
Finding Disjoint Paths on Directed Acyclic Graphs
Declarative Graph Algorithms via Knuth-Bendix Completion
Case studies for the derivation of pointer algorithms
Evaluation of Index-Based Skyline Algorithms
Failure-Sensitive Specification: A formal method for finding failure modes
Safety Optimization: A combination of fault tree analysis and optimization techniques
Embedding CTL* in an Extension to Interval Temporal Logic (ITL)
Improved Decomposition of Signal Transition Graphs
Greedy-Like Algorithms in Kleene Algebra
Layered Graph Traversals and Hamiltonian Path Problems - An Algebraic Approach
A lower bound for the treewidth of k-outerplanar graphs
Improved Algorithms for the 2-Vertex Disjoint Paths Problem
Finding Disjoint Paths on Directed Acyclic Graphs
Declarative Graph Algorithms via Knuth-Bendix Completion
Case studies for the derivation of pointer algorithms
Evaluation of Index-Based Skyline Algorithms
Failure-Sensitive Specification: A formal method for finding failure modes
Safety Optimization: A combination of fault tree analysis and optimization techniques
Embedding CTL* in an Extension to Interval Temporal Logic (ITL)
Improved Decomposition of Signal Transition Graphs
Greedy-Like Algorithms in Kleene Algebra