- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
1 Online-Ressource.
- Sprache
-
Englisch
- Erschienen in
-
Domination and Cut Problems on Chordal Graphs with Bounded Leafage ; volume:86 ; number:5 ; day:29 ; month:12 ; year:2023 ; pages:1428-1474 ; date:5.2024
Algorithmica ; 86, Heft 5 (29.12.2023), 1428-1474, 5.2024
- Urheber
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-023-01196-y
- URN
-
urn:nbn:de:101:1-2407022115132.380644522432
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 11:01 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
- Galby, Esther
- Marx, Dániel
- Schepper, Philipp
- Sharma, Roohani
- Tale, Prafullkumar
- SpringerLink (Online service)
Ähnliche Objekte (12)
Domination and cut problems on chordal graphs with bounded leafage
Domination and cut problems on chordal graphs with bounded leafage
Cut problems on graphs
Domination problems on special graph classes
Total Domination Versus Domination in Cubic Graphs
Multiple domination in graphs
Multiple domination in graphs
On domination in graphs
From w-Domination in Graphs to Domination Parameters in Lexicographic Product Graphs
Approximation algorithms for network design and cut problems in bounded-treewidth
A Graph Class related to the Structural Domination Problem
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width
Domination and cut problems on chordal graphs with bounded leafage
Domination and cut problems on chordal graphs with bounded leafage
Cut problems on graphs
Domination problems on special graph classes
Total Domination Versus Domination in Cubic Graphs
Multiple domination in graphs
Multiple domination in graphs
On domination in graphs
From w-Domination in Graphs to Domination Parameters in Lexicographic Product Graphs
Approximation algorithms for network design and cut problems in bounded-treewidth
A Graph Class related to the Structural Domination Problem
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width
Domination and cut problems on chordal graphs with bounded leafage
Domination and cut problems on chordal graphs with bounded leafage
Cut problems on graphs
Domination problems on special graph classes
Total Domination Versus Domination in Cubic Graphs
Multiple domination in graphs
Multiple domination in graphs
On domination in graphs
From w-Domination in Graphs to Domination Parameters in Lexicographic Product Graphs
Approximation algorithms for network design and cut problems in bounded-treewidth
A Graph Class related to the Structural Domination Problem