- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2192-6247
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Technische Berichte des Instituts für Informatik der CAU Kiel ; 1701
- Klassifikation
-
Physik
- Ereignis
-
Veröffentlichung
- (wo)
-
Kiel
- (wer)
-
Universitätsbibliothek Kiel
- (wann)
-
2017
- Urheber
- URN
-
urn:nbn:de:gbv:8:1-zs-00000294-a0
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:50 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
- Rüegg, Ulf
- Adolf, Marc
- Cyruk, Michael
- Flohr, Astrid Mariana
- Hanxleden, Reinhard von
- Universitätsbibliothek Kiel
Entstanden
- 2017
Ähnliche Objekte (12)
Typical Sequences Revisited — Computing Width Parameters of Graphs
Graph bisection revisited
3D Minimum Channel Width Distribution in a Ni-Base Superalloy
Solving Problems on Graphs of High Rank-Width
Canonizing Graphs of Bounded Tree Width in Logspace
Binary Search in Graphs Revisited
An Improved Isomorphism Test for Bounded-Tree-Width Graphs
On Tradeoffs Between Width- and Fill-like Graph Parameters
Minimum Degree Stability of H-Free Graphs
Matching Cut in Graphs with Large Minimum Degree
On the minimum degree of minimal Ramsey graphs
Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs
Typical Sequences Revisited — Computing Width Parameters of Graphs
Graph bisection revisited
3D Minimum Channel Width Distribution in a Ni-Base Superalloy
Solving Problems on Graphs of High Rank-Width
Canonizing Graphs of Bounded Tree Width in Logspace
Binary Search in Graphs Revisited
An Improved Isomorphism Test for Bounded-Tree-Width Graphs
On Tradeoffs Between Width- and Fill-like Graph Parameters
Minimum Degree Stability of H-Free Graphs
Matching Cut in Graphs with Large Minimum Degree
On the minimum degree of minimal Ramsey graphs
Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs
Typical Sequences Revisited — Computing Width Parameters of Graphs
Graph bisection revisited
3D Minimum Channel Width Distribution in a Ni-Base Superalloy
Solving Problems on Graphs of High Rank-Width
Canonizing Graphs of Bounded Tree Width in Logspace
Binary Search in Graphs Revisited
An Improved Isomorphism Test for Bounded-Tree-Width Graphs
On Tradeoffs Between Width- and Fill-like Graph Parameters
Minimum Degree Stability of H-Free Graphs
Matching Cut in Graphs with Large Minimum Degree
On the minimum degree of minimal Ramsey graphs