- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Treewidth Lower Bounds with Brambles ; volume:51 ; number:1 ; day:6 ; month:10 ; year:2007 ; pages:81-98 ; date:5.2008
Algorithmica ; 51, Heft 1 (6.10.2007), 81-98, 5.2008
- Urheber
-
Bodlaender, Hans L.
Grigoriev, Alexander
Koster, Arie M. C. A.
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-007-9056-z
- URN
-
urn:nbn:de:101:1-2021080708384963292291
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:47 MESZ
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.
Beteiligte
- Bodlaender, Hans L.
- Grigoriev, Alexander
- Koster, Arie M. C. A.
- SpringerLink (Online service)
Ähnliche Objekte (12)
Self-Adjoint Extensions with Friedrichs Lower Bound
Proportionality’s Lower Bound
Consistency of Circuit Lower Bounds with Bounded Theories
Band width estimates with lower scalar curvature bounds
Guaranteed lower bounds for eigenvalues
Lower bounds for RCPSP-max
Lower Bound Functions for Polynomials
Lower Bounds for Heuristic Algorithms
Lower bounds for resource levelling problems with renewable resources
Some lower bounds in dynamic networks with oblivious adversaries
Adaptive guaranteed lower eigenvalue bounds with optimal convergence rates
Geometry of spaces with a synthetic lower curvature bound
Self-Adjoint Extensions with Friedrichs Lower Bound
Proportionality’s Lower Bound
Consistency of Circuit Lower Bounds with Bounded Theories
Band width estimates with lower scalar curvature bounds
Guaranteed lower bounds for eigenvalues
Lower bounds for RCPSP-max
Lower Bound Functions for Polynomials
Lower Bounds for Heuristic Algorithms
Lower bounds for resource levelling problems with renewable resources
Some lower bounds in dynamic networks with oblivious adversaries
Adaptive guaranteed lower eigenvalue bounds with optimal convergence rates
Geometry of spaces with a synthetic lower curvature bound
Self-Adjoint Extensions with Friedrichs Lower Bound
Proportionality’s Lower Bound
Consistency of Circuit Lower Bounds with Bounded Theories
Band width estimates with lower scalar curvature bounds
Guaranteed lower bounds for eigenvalues
Lower bounds for RCPSP-max
Lower Bound Functions for Polynomials
Lower Bounds for Heuristic Algorithms
Lower bounds for resource levelling problems with renewable resources
Some lower bounds in dynamic networks with oblivious adversaries
Adaptive guaranteed lower eigenvalue bounds with optimal convergence rates