- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs ; day:31 ; month:7 ; year:2020 ; pages:1-17
Algorithmica ; (31.7.2020), 1-17
- Urheber
-
Novotná, Jana
Okrasa, Karolina
Pilipczuk, Michał
Rzążewski, Paweł
Leeuwen, Erik Jan van
Walczak, Bartosz
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-020-00745-z
- URN
-
urn:nbn:de:101:1-2020092721181690456942
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
2025-08-14T10:58:08+0200
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
- Novotná, Jana
- Okrasa, Karolina
- Pilipczuk, Michał
- Rzążewski, Paweł
- Leeuwen, Erik Jan van
- Walczak, Bartosz
- SpringerLink (Online service)
Ähnliche Objekte (12)
Modern algorithms for large sparse eigenvalue problems
Efficient motif finding algorithms for large-alphabet inputs
Flexible and multi-shift induced dimension reduction algorithms for solving large sparse linear systems
Deterministic Sparse FFT Algorithms
Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs
Linear kernels and linear-time algorithms for finding large cuts
Linear kernels and linear-time algorithms for finding large cuts
Linear Kernels and Linear-Time Algorithms for Finding Large Cuts
Finding large cliques in sparse semi-random graphs by simple randomized search heuristics
Finding Reusable Modules Using Sparse Matrix Decompositions
Large sparse numerical optimization
Faster Algorithms for Sparse Fourier Transform
Modern algorithms for large sparse eigenvalue problems
Efficient motif finding algorithms for large-alphabet inputs
Flexible and multi-shift induced dimension reduction algorithms for solving large sparse linear systems
Deterministic Sparse FFT Algorithms
Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs
Linear kernels and linear-time algorithms for finding large cuts
Linear kernels and linear-time algorithms for finding large cuts
Linear Kernels and Linear-Time Algorithms for Finding Large Cuts
Finding large cliques in sparse semi-random graphs by simple randomized search heuristics
Finding Reusable Modules Using Sparse Matrix Decompositions
Large sparse numerical optimization
Faster Algorithms for Sparse Fourier Transform
Modern algorithms for large sparse eigenvalue problems
Efficient motif finding algorithms for large-alphabet inputs
Flexible and multi-shift induced dimension reduction algorithms for solving large sparse linear systems
Deterministic Sparse FFT Algorithms
Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs
Linear kernels and linear-time algorithms for finding large cuts
Linear kernels and linear-time algorithms for finding large cuts
Linear Kernels and Linear-Time Algorithms for Finding Large Cuts
Finding large cliques in sparse semi-random graphs by simple randomized search heuristics
Finding Reusable Modules Using Sparse Matrix Decompositions
Large sparse numerical optimization