- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Solving Problems on Graphs of High Rank-Width ; day:13 ; month:2 ; year:2017 ; pages:1-30
Algorithmica ; (13.2.2017), 1-30
- Classification
-
Mathematik
- Creator
-
Eiben, Eduard
- Contributor
-
Ganian, Robert
Szeider, Stefan
SpringerLink (Online service)
- DOI
-
10.1007/s00453-017-0290-8
- URN
-
urn:nbn:de:1111-201703081880
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:59 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
- Eiben, Eduard
- Ganian, Robert
- Szeider, Stefan
- SpringerLink (Online service)
Other Objects (12)
Minimum-width graph layering revisited
Typical Sequences Revisited — Computing Width Parameters of Graphs
Canonizing Graphs of Bounded Tree Width in Logspace
An Improved Isomorphism Test for Bounded-Tree-Width Graphs
On Tradeoffs Between Width- and Fill-like Graph Parameters
Solving singular generalized eigenvalue problems by a rank-completing perturbation
Solving clustered low-rank semidefinite programs arising from polynomial optimization
Estimating PageRank deviations in crawled graphs
Switched symplectic graphs and their 2-ranks
Estimating PageRank deviations in crawled graphs
Facial width-to-height ratio differs by social rank across organizations, countries, and value systems
High performance answer set solving
Minimum-width graph layering revisited
Typical Sequences Revisited — Computing Width Parameters of Graphs
Canonizing Graphs of Bounded Tree Width in Logspace
An Improved Isomorphism Test for Bounded-Tree-Width Graphs
On Tradeoffs Between Width- and Fill-like Graph Parameters
Solving singular generalized eigenvalue problems by a rank-completing perturbation
Solving clustered low-rank semidefinite programs arising from polynomial optimization
Estimating PageRank deviations in crawled graphs
Switched symplectic graphs and their 2-ranks
Estimating PageRank deviations in crawled graphs
Facial width-to-height ratio differs by social rank across organizations, countries, and value systems
High performance answer set solving
Minimum-width graph layering revisited
Typical Sequences Revisited — Computing Width Parameters of Graphs
Canonizing Graphs of Bounded Tree Width in Logspace
An Improved Isomorphism Test for Bounded-Tree-Width Graphs
On Tradeoffs Between Width- and Fill-like Graph Parameters
Solving singular generalized eigenvalue problems by a rank-completing perturbation
Solving clustered low-rank semidefinite programs arising from polynomial optimization
Estimating PageRank deviations in crawled graphs
Switched symplectic graphs and their 2-ranks
Estimating PageRank deviations in crawled graphs
Facial width-to-height ratio differs by social rank across organizations, countries, and value systems