- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs ; day:31 ; month:7 ; year:2020 ; pages:1-17
Algorithmica ; (31.7.2020), 1-17
- Creator
-
Novotná, Jana
Okrasa, Karolina
Pilipczuk, Michał
Rzążewski, Paweł
Leeuwen, Erik Jan van
Walczak, Bartosz
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-020-00745-z
- URN
-
urn:nbn:de:101:1-2020092721181690456942
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:58 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.
Associated
- Novotná, Jana
- Okrasa, Karolina
- Pilipczuk, Michał
- Rzążewski, Paweł
- Leeuwen, Erik Jan van
- Walczak, Bartosz
- SpringerLink (Online service)
Other Objects (12)
Faster algorithms for counting subgraphs in sparse graphs
Parallel graph algorithms for finding weighted matchings and subgraphs in computational science
Induced Subgraphs of Induced Subgraphs of Large Chromatic Number
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
Modern algorithms for large sparse eigenvalue problems
Small Subgraphs with Large Average Degree
Parallel algorithms for the construction of special subgraphs
Parallel algorithms for the construction of special subgraphs
Efficient motif finding algorithms for large-alphabet inputs
Plane and simple : using planar subgraphs for efficient algorithms
Deterministic Sparse FFT Algorithms
Faster algorithms for counting subgraphs in sparse graphs
Parallel graph algorithms for finding weighted matchings and subgraphs in computational science
Induced Subgraphs of Induced Subgraphs of Large Chromatic Number
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
Modern algorithms for large sparse eigenvalue problems
Small Subgraphs with Large Average Degree
Parallel algorithms for the construction of special subgraphs
Parallel algorithms for the construction of special subgraphs
Efficient motif finding algorithms for large-alphabet inputs
Plane and simple : using planar subgraphs for efficient algorithms
Deterministic Sparse FFT Algorithms
Faster algorithms for counting subgraphs in sparse graphs
Parallel graph algorithms for finding weighted matchings and subgraphs in computational science
Induced Subgraphs of Induced Subgraphs of Large Chromatic Number
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
Modern algorithms for large sparse eigenvalue problems
Small Subgraphs with Large Average Degree
Parallel algorithms for the construction of special subgraphs
Parallel algorithms for the construction of special subgraphs
Efficient motif finding algorithms for large-alphabet inputs
Plane and simple : using planar subgraphs for efficient algorithms