- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Solving Problems on Graphs of High Rank-Width ; day:13 ; month:2 ; year:2017 ; pages:1-30
Algorithmica ; (13.2.2017), 1-30
- Klassifikation
-
Mathematik
- Urheber
-
Eiben, Eduard
- Beteiligte Personen und Organisationen
-
Ganian, Robert
Szeider, Stefan
SpringerLink (Online service)
- DOI
-
10.1007/s00453-017-0290-8
- URN
-
urn:nbn:de:1111-201703081880
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:59 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
- Eiben, Eduard
- Ganian, Robert
- Szeider, Stefan
- SpringerLink (Online service)
Ähnliche Objekte (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 clustered low-rank semidefinite programs arising from polynomial optimization
Solving singular generalized eigenvalue problems by a rank-completing perturbation
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 clustered low-rank semidefinite programs arising from polynomial optimization
Solving singular generalized eigenvalue problems by a rank-completing perturbation
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 clustered low-rank semidefinite programs arising from polynomial optimization
Solving singular generalized eigenvalue problems by a rank-completing perturbation
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